UNIT 1:
Connectedness – Components
Hamiltonian paths and circuits
Trees – Properties of trees
Distance and centers in tree
UNIT 2:
Spanning trees in a weighted graph
cut sets – Properties of cut set – All cut sets
All cut sets – Fundamental circuits and cut sets
Connectivity and separability
Network flows – 1-Isomorphism – 2-Isomorphism
Planer graphs – Different representation of a planer graph
UNIT 3:
Directed graphs – Types of directed graphs
Directed graphs – Types of directed graphs
Digraphs and binary relations
Directed paths and connectedness – Euler graphs.
UNIT 4:
Principle of inclusion and exclusion
Arrangements with forbidden positions.
Fundamental principles of counting –
Permutations and combinations
Permutations and combinations
combinations with repetition
UNIT 5:
Exponential generating function
First order and second order
Non-homogeneous recurrence relations
Method of generating functions.
