DR.

PAULS ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
LESSON PLAN
Name of the Faculty

: Appasami G.

Designation: Asst. Professor

Branch/Semester

: CSE / VIII

Academic Year: 2016 - 17

Subject Code and Name

: CS6702 GRAPH THEORY AND APPLICATIONS

S.
No
.

Book Referred

Proposed Dates
Portions Covered
Date

Hours

Actual Date
of
Completion

with Pages

Book

Page

No.

No.

T1
T1
T1
T1
T1
T1
T1
T1
T1

1
14
16
21
23
30
39
45
48

T1
T1
T1
T1
T1
T1
T1
T1
T1

55
61
68
73
75
79
80
88

T1
T1
T1
T1
T1
T1
T1
T1

165
174
177
186
194
198
201
203

UNIT I INTRODUCTION
1
2
3
4
5
6
7
8
9

1
1
1
1
1
1
1
1
1

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

1
2
3
4
5
6
7
8

1
1
1
1
1
1
1
1

Spanning trees - Fundamental circuits

Spanning trees in a weighted graph sets
cut sets - Properties of cut set - All cut
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

90

UNIT III MATRICES, COLOURING AND DIRECTED GRAPH

1
2
3
4
5
6
7
8

1
1
1
1
1
1
1
1

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 V PERMUTATIONS & COMBINATIONS

1
2
3
4
5
6
7
8

1
1
1
1
1
1
1
2

Fundamental principles of counting

Permutations and combinations
Binomial theorem
Combinations with repetition
Combinatorial numbers
Principle of inclusion and exclusion
Derangements
Arrangements with forbidden positions

T2
T2
T2
T2
T2
T2
T2
T2

3
6
14
26
36
385
402
406

T2
T2
T2
T2
T2
T2
T2
T2

415
432
436
440
447
456
470
482

UNIT V GENERATING FUNCTIONS

1
2
3
4
5
6
7
8

1
1
1
1
1
1
2
2

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

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.

REFERENCE BOOKS:
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.

Faculty In charge

HOD

Dean / Principal