SECOND SEMESTER 2022-2023

Course Handout Part II

16-01-2023
In addition to part-I (General Handout for all courses appended to the time table) this portion gives further
specific details regarding the course.
Course No. : MATH F243
Course Title : Graphs & Networks
Instructor-in-charge : A. Michael Alphonse
Instructors : A. Michael Alphonse, Faiz Imam, Hirendra Kumar Garai

Scope and Objective of the Course: The applications of graph theory are ranging from social sciences to
electrical engineering and computer science to management. Every graph theoretic model is supported by a
strong mathematical scheme. The objective of the course is, in addition to apply the graph theoretic model to
different applications; students can develop a strong concept on the logical foundations, and can develop of a
standard mathematical formulation for different real life problems.

Textbooks:
1. Gary Chartrand & Ping Zhang: Introduction to Graph Theory, Mcgraw-hill, Indian Edition 2006.
Reference books
1. E. G. Goodaire & M. M. Parmenter : Discrete Mathematics with graph theory, 3rd edition, Pearson,
2002.
2. Narsingh Deo: Graph theory with applications to engineering & computer science, PHI 1974.
3. G. Agnarsson and R. Greenlaw: Graph Theory Modeling, Applications and Algorithms, Pearson, 2007.

Course Plan:
Lecture Learners objective Topics to be covered Chapter
No. in the
Text Book
1-4 To introduce the concept of graph and Graphs and Graph Models, Connected Chapter
its representation. Distinguish between Graphs, Classes of graphs, Multigraphs 1.1-1.4
multigraphs and digraphs. and Digraphs.
5-8 Understanding the graphs through the Degree of a vertex, Regular graphs, Chapter
degree of the vertices, order and Size. Degree Sequence, Graphs and Matrices, 2.1-2.5
Relationship between the graphs and Irregular graphs.
matrices.
 9-12 Understanding when two graphs are Isomorphic Graphs, Definition of Chapter
equal isomorphism, Isomorphism as a relation 3.1-3.3

13-16 Studying a specific class of graphs Bridges, Trees, equivalent definitions, Chapter
called Trees and their uses in spanning tree, Minimal spanning tree, 4.1-4.4
Optimization Prim’s & Kruskal Algorithm
Binary trees, Distance between
spanning tree, eccentricity, Centre(s),
diameter of tree & connected graph.
17-20 How spanning tree is connected with Cut vertices, Blocks, Connectivity, Chapter
concept of special type of cut set & Menger’s Theorem 5.1-5.4
circuit in a connected graph

21-23 To appreciate the difference between Eulerian Graphs, Hamiltonian Graphs, Chapter
edge traversal & vertex traversal Hamiltonian walk and numbers 6.1-6.3
24-26 To determine the matching number, Matchings, Factorization Chapter
covering number. 8.1-8.2
27-30 To study the Planar Graphs, Surface Planar Graphs, Euler identity, Detection Chapter
Graphs and their Properties of planarity, Embedded graphs on 9.1-9.3
surface. Graph Minors
31-34 To study the Graph coloring Problems The four color problem, vertex Chapter
and their applications coloring, edge coloring, chromatic 10.1-10.3
number, chromatic partitioning

35-36 To study the Digraphs Directed graph, Euler digraph, Chapter

Strongly connected & weakly 7.1
connected digraphs,
37- 40 Directed weighted network, relevance Network flow, Max Flow- Min Cut Chapters
of maximum flow theorem, Fulkerson Algorithm for in R1 :
Maximum flow, Shortest path problem 15.1, 15.2
& Dijkstara Algorithm. and
10.4.1-
10.4.3

Evaluation Scheme:
Evaluation Component Duration Weightage Date & Time Nature of
Component
14/03 9.30 - 11.00AM
Mid-semester Examination 90 Minutes 30% Open book
Quiz 1 7% Details will be announced in Closed book
Quiz 2 7% the class
Assignment 1 6% Open Book
Assignment 2 5%
 Comprehensive Examination 3 Hours 45% 10/05 FN Closed Book
Total Marks: 100

Chamber Consultation Hour: To be announced in the class.

Notices: All notices about the course will be put up in the CMS Notice Board.

Make-up Policy: Make up will be granted only in genuine cases. Permission must be taken in advance.

Academic Honesty and Integrity Policy: Academic honesty and integrity are to be maintained by all the
students throughout the semester and no type of academic dishonesty is acceptable.

INSTRUCTOR-IN-CHARGE