Proceedings of the 26th Academic Council held on 18.5.

2012

MAT206

GraphTheoryanditsapplications

LTPC
3104

VersionNo.
1.1
Course
: MAT106 Discrete Mathematical Structures
Prerequisites
Objectives
To provide fundamental ideas on graph theory required for the study of Computer
Science.
ExpectedOutcome
At the end of this course students will be able to:
Understand the basic notions of Graph Theory
Knowing Fundamental Theorems in Graph Theory
Emphasize the study of computational and algorithmic aspects of Graph Theory
Unit1
Fundamentalsofgraphs
9+3 hours
Graphs introduction isomorphism sub graphs walks- paths -circuits
connectedness components Euler graphs Hamiltonian paths and circuits.
Trees,FundamentalcircuitsandCutsets
9+3hours
Unit2
Trees properties of trees distance and centers in tree rooted and binary trees spanning trees spanning trees in a weighted graph. Cut sets properties of cut set
fundamental circuits and cut sets.
Unit3
Cutvertices,Planaranddualgraphs
9+3 Hours
Connectivity and separability network flows 1-isomorphism 2-isomorphism.
Planar and dual graphs - combinatorial representation planar graphs- Kuratowskis
graphs- detection of planarity -geometric dual graphs.
Unit4

Matrixrepresentationofgraphs,coloring
9+3 hours
coveringandpartitioning
Incidence matrix sub matrices circuit matrix path matrix adjacency matrix.
Chromatic number - chromatic partitioning chromatic polynomial - matching
covering four color problem.
Unit5
Directedgraphs,GraphTheoreticalgorithms
9+3 hours
Digraphs types of digraphs directed paths and connectedness Euler graphs
adjacency matrix of a digraph - tournament. Algorithms - connectedness and
components spanning tree fundamental circuits cut vertices directed circuits
shortest path algorithm.
TextBook
Narasing Deo, Graph theory with application to Engineering and Computer Science,
Prentice Hall India (2010).
Topics in the Chapters: 1, 2, 3, 4, 5, 7, 8, 9, 11

824

Proceedings of the 26th Academic Council held on 18.5.2012

ReferenceBooks
1. West, D.B, Introduction to Graph Theory, second ed., PrenticeHall, Englewood
Cliffs, NJ, ( 2001).
2. F.Harary,Graph Theory, Addison Wesley/ Narosa (1998).
3. E.M.Reingold, J.Nievergelt, N.Deo, Combinatorial Algorithms: Theory And
Practice, Prentice Hall, N.J (1977).
4. R.J. Wilson, Introduction to Graph Theory, Fourth Edition,
Pearson Education (2003).
5. Kenneth H. Rosen, Discrete Mathematics and its applications, 5th edition, Tata
McGraw Hill, (2003).
ModeofEvaluation:
RecommendedbytheBoardofStudieson12052012
Dateofapprovalbythe
AcademicCouncil:

825