NATIONAL INSTITUTE OF TECHNOLOGY SILCHAR- SILCHAR- ASSAM-788010-INDIA/UG CURRICULA/w.e.f.
2018 batch
CS 305 Graph Theory L T P C
B.Tech (CSE) Fifth Semester (Core) 3 1 0 4
Unit-1 Fundamental Concepts: Graphs and Graph Models; Vertex degree, Matrix
representation of graphs, Isomorphism; Contraction and Sub-graphs; Paths,
Cycles, Connectivity in graphs; Bipartite graphs.
Unit-2 Trees and Distances: Properties of Trees, Distance in Trees and Graphs; Enumeration
of Trees; Spanning Trees, Fundamental Circuits; Finding all Spanning Trees of
a Graph; Minimum Spanning Trees; Shortest Paths.
Unit-3 Matching and Covers: Maximum Matching’s, Hall’s Theorem; Min-Max
Theorem; Independent Sets and Covers; Maximum Bipartite Matching
Connectivity and Paths: Paths, Cycles, and Trails; Cuts and Connectivity,
Edge Connectivity; Connectedness in Undirected and Directed Graphs; 2-
connected Graphs, k-connected Graphs, k-edge-connected Graphs; Paths and
Isomorphism; Counting Paths between Vertices; Euler Paths and Circuits;
Hamiltonian Paths and Circuits.
Unit-4 Cut-sets and Cut-vertices: Properties of Cut-sets, All Cut-sets in a Graph;
Fundamental Circuits and Cut-sets; Connectivity and Separability; Network
Flows;
Planar Graphs and Dual Graphs: Combinatorial and Geometric Graphs;
Planar Graphs, Drawings in the Plane, Euler’s Formula; Dual Graphs,
Geometric Dual, Combinatorial Dual; Kuratowski’s Theorem; Detection of
Planarity; Thickness and Crossings
Unit-5 Coloring of Graphs: Chromatic Number, Chromatic Partitioning,
Chromatic Polynomial; Matching’s; Coverings; The Four-Color Problem
Books:
1. N. Deo, Graph Theory with applications to Engineering and Computer Science,
Prentice Hall of India.
2. K. H. Rosen, Discrete Mathematics and applications, 7th edition, Tata McGraw Hill.
3. R. Diestel, Graph Theory, 2nd edition, Springer-Verlag.
Course Outcomes (COs):
After completion of this course, the students are expected to
1. Understand and describe some important classes of graph theoretic problems and
formally apply graph-theoretic terminologies and notations.
SYLLABI FOR DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING 96 | P a g e
