BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI- HYDERABAD CAMPUS

FIRST SEMESTER 2015-2016

INSTRUCTION DIVISION
COURSE HANDOUT (PART-II)
Date: 01-08-2015
In addition to part-I (General Handout for all courses appended to the time table) portion here give specific details
about the course.
Course No.
: MATH F243
Course Title
: Graphs & Networks
Instructor-in-charge
: B. MISHRA
1. Course Description: Course deals with basics of graphs, simple graphs, types of graph , isomorphism in graphs,
Euler & Hamiltonian graphs, trees & their properties, directed tree, spanning tree, number of spanning trees & Matrix
representation of graph, colouring of graph, planarity, independence number, Chromatic number of simple graphs,
connectivity, cut set, directed graph, shortest path & maximal flow in a network. Kirchhoff matrix & number of
directed spanning trees in a directed graph.
2. Scope and Objective of the Course: The importance of graph theory can never be exaggerated considering the
wide range of its applications, from social sciences to electrical engineering and computer science to management.
The rigorous foundation of the subject is thus desirable. The objective of the course is, in addition to logical
foundations, development of the basic skills to tackle problems in Graph theory. It is also aimed at understanding how
various problems arising from real life or sciences as well as recreational puzzles can be converted to graph theoretic
problems like shortest paths, network flows, chromatic numbers, connectivity etc.
3. Text Books:
Narsingh Deo: Graph theory with applications to engineering & computer science, PHI 1974.
4. Reference Books:
R1: Gary Chartrand & Ping Zhang : Introduction to Graph Theory , Tata Mcgraw-hill, Indian Edition 2006.
R2: E. G. Goodaire & M. M. Parmenter : Discrete Mathematics with graph theory, 3rd edition, Pearson, 2002.
R3: G. Agnarsson and R. Greenlaw : Graph Theory Modeling, Applications and Algorithms, Pearson, 2007.
5. Lecture Plan :
Lecture
Learners objective
No.
1-6
To appreciate concept of graph & simple
graph & their representation.
Distinguish clearly between different
definitions in graph & difference between
edge traversal & vertex traversal

Topic

Ref.

Graph, degree sequence, matrix

representation & types of graph,
operations on graph, Paths, circuits,
Subgraph,
Euler&
Hamiltonian
Graphs, Fleury algorithm, Traveling
salesman Problem, operation on
graphs

Chapter 1 &
Chapter 2 of
Text book &
Chapter 2 of
R1

7-8

Difference between difficult & simple Isomorphism in graphs

concept
connectedness simple

difficult

Chapter 2

9-13

Appreciate different equivalent definitions Tree, equivalent definitions, spanning

of tree & tree as a structure
tree, Minimal spanning tree, Prims &
Kruskal Algorithm

Chapter 3

14-16

Concepts of distance between spanning Binary trees, Distance between

trees, tree and rooted binary tree
spanning tree , eccentricity& Centre(s)
of tree & connected graph ,diameter
of tree & connected graph

Chapter 3

17-21

How spanning tree is connected with Cut-sets & Fundamental cut set,
concept of special type of cut set & Edge
&
vertex
Connectivity,
circuit in a connected graph
separability , Mengers theorem

Chapter 4
&
R2

22-26

How graph coloring problem is related to Maximal independent sets, Vertex

independent sets of graph, scheduling coloring & Chromatic Number,
problems, planer map
Chromatic Partitioning, Minimal
dominating set, knights tour, Planar
map coloring, Matching number &
covering Number of a connected
graph, matching in Bipartite graphs

Chapter 8

27-31

How simple concept of planarity of a

graph is relevant to several problems
like planar maps & electrical circuits
How concept of isomorphism is different
in digraphs ,Difference between different
type connected digraphs & spanning tree &
directed spanning tree

Chapter 5

32-36

37- 42

Planar
Graph,
Euler
formula,
Detection of planarity, Dual of a
planar graph.
Directed graph, Euler digraph,
Isomorphism in digraph
Strongly connected & weakly
connected digraphs,

Directed weighted network, relevance of Network flow, Max Flow- Min Cut
maximum flow , searching a graph
theorem, Fulkerson Algorithm for
Maximum flow, Shortest path problem
& Dijkstara Algorithm , Depth first
Search

Chapter 9

Sections 14.1,
14.2,
10.4.1 to
10.4.3 and
12.5 of R2.

6. Evaluation Scheme:
Evaluation Component

Duration

Weight
age

Test-I

60 Minutes

20%

Test-II

60 Minutes

Assignment(s)/Seminar
Comprehensive

20%

Date & Time

11/9, 11.30-12.30 PM
10/11, 11.30-12.30 PM

Remarks
Closed book
Closed book

20%
3 Hours

40%

08/12 FN

Closed book

7. Notices: All notices about the course will be put on CMS.

8. Chamber Consultation Hour: To be announced in the class.
9. Make-up: Make up will be granted only in genuine cases. Permission must be taken in advance.
Instructor-in-charge
MATH F243