The document outlines the objectives and units of a course on Graph Theory and Applications. The 5 units cover topics such as graphs, trees, connectivity, planarity, matrices, coloring, permutations, combinations, and generating functions. Students will learn fundamental graph theory topics and results, techniques of proofs and analysis, and be able to write precise definitions, construct examples, and prove mathematical statements about graphs.

1. CS6702 GRAPH THEORY AND APPLICATIONS L T P C 3 0 0 3
OBJECTIVES:The student should be made to:
 Be familiar with the most fundamental Graph Theory topics and results.
 Be exposed to the techniques of proofs and analysis.
UNIT I INTRODUCTION 9
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –
Connectedness – Components – Euler graphs – Hamiltonian paths and circuits – Trees –
Properties of trees – Distance and centers in tree – Rooted and binary trees.
UNIT II TREES, CONNECTIVITY & PLANARITY 9
Spanning trees – Fundamental circuits – Spanning trees in a weighted graph – cut sets –
Properties of cut set – All cut sets – Fundamental circuits and cut sets – Connectivity and
separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and
geometric graphs – Planer graphs – Different representation of a planer graph.
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH 8
Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching –
Covering -Four color problem – Directed graphs – Types of directed graphs – Digraphs
and binary relations – Directed paths and connectedness – Euler graphs.
UNIT IV PERMUTATIONS & COMBINATIONS 9
Fundamental principles of counting - Permutations and combinations - Binomial theorem -
combinations with repetition - Combinatorial numbers - Principle of inclusion and
exclusion - Derangements - Arrangements with forbidden positions.
UNIT V GENERATING FUNCTIONS 10
Generating functions - Partitions of integers - Exponential generating function –
Summation operator - Recurrence relations - First order and second order – Non-
homogeneous recurrence relations - Method of generating functions.
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
 Write precise and accurate mathematical definitions of objects in graph theory.
 Use mathematical definitions to identify and construct examples and to distinguish
examples from non-examples.
 Validate and critically assess a mathematical proof.
 Use a combination of theoretical knowledge and independent mathematical
thinking in creative investigation of questions in graph theory.
 Reason from definitions to construct mathematical proofs.
TEXT BOOKS:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer
Science”, Prentice Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”,
Addison Wesley, 1994.
REFERENCES:
1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer
Scientists and Mathematicians” , Prentice Hall of India, 1996.
3. Liu C.L., “Elements of Discrete Mathematics”, Mc Graw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007.

2. UNIT I INTRODUCTION
Graphs
Introduction
Isomorphism
Sub graphs
Walks, Paths, Circuits
Connectedness
Components
Euler graphs
Hamiltonian paths and circuits
Trees
Properties of trees
Distance and centers in tree
Rooted and binary trees
UNIT II TREES, CONNECTIVITY & PLANARITY
Spanning trees
Fundamental circuits
Spanning trees in a weighted graph
cut sets
Properties of cut set
All cut sets
Fundamental circuits and cut sets
Connectivity and separability
Network flows
1-Isomorphism
2-Isomorphism
Combinational and geometric graphs
Planer graphs
Different representation of a planer graph
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
Chromatic number
Chromatic partitioning
Chromatic polynomial
Matching
Covering
Four color problem
Directed graphs
Types of directed graphs
Digraphs and binary relations
Directed paths and connectedness
Euler graphs
UNIT IV PERMUTATIONS & COMBINATIONS
Fundamental principles of counting
Permutations and combinations
Binomial theorem
combinations with repetition
Combinatorial numbers
Principle of inclusion and exclusion
Derangements
Arrangements with forbidden positions

3. UNIT V GENERATING FUNCTIONS
Generating functions
Partitions of integers
Exponential generating function
Summation operator
Recurrence relations
First order and second order
Non-homogeneous recurrence relations
Method of generating functions

4. UNIT I INTRODUCTION
1. 1 Graphs
1. 2 Introduction
1. 3 Isomorphism
1. 4 Sub graphs
1. 5 Walks, Paths, Circuits
1. 6 Connectedness
1. 7 Components
1. 8 Euler graphs
1. 9 Hamiltonian paths and circuits
1. 10 Trees
1. 11 Properties of trees
1. 12 Distance and centers in tree
1. 13 Rooted and binary trees
UNIT II TREES, CONNECTIVITY & PLANARITY
2. 1 Spanning trees
2. 2 Fundamental circuits
2. 3 Spanning trees in a weighted graph
2. 4 cut sets
2. 5 Properties of cut set
2. 6 All cut sets
2. 7 Fundamental circuits and cut sets
2. 8 Connectivity and separability
2. 9 Network flows
2. 10 1-Isomorphism
2. 11 2-Isomorphism
2. 12 Combinational and geometric graphs
2. 13 Planer graphs
2. 14 Different representation of a planer graph
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
3. 1 Chromatic number
3. 2 Chromatic partitioning
3. 3 Chromatic polynomial
3. 4 Matching
3. 5 Covering
3. 6 Four color problem
3. 7 Directed graphs
3. 8 Types of directed graphs
3. 9 Digraphs and binary relations
3. 10 Directed paths and connectedness
3. 11 Euler graphs
UNIT IV PERMUTATIONS & COMBINATIONS
4. 1 Fundamental principles of counting
4. 2 Permutations and combinations
4. 3 Binomial theorem
4. 4 Combinations with repetition
4. 5 Combinatorial numbers
4. 6 Principle of inclusion and exclusion
4. 7 Derangements
4. 8 Arrangements with forbidden positions

5. UNIT V GENERATING FUNCTIONS
5. 1 Generating functions
5. 2 Partitions of integers
5. 3 Exponential generating function
5. 4 Summation operator
5. 5 Recurrence relations
5. 6 First order and second order
5. 7 Non-homogeneous recurrence relations
5. 8 Method of generating functions.