Professional Documents
Culture Documents
b) Let (G ) be the number of components of G, then prove that the number of edges of a simple [10]
( n )( n 1)
graph with components cannot exceed .
2
Page 1 of 2
5. a) Define fundamental circuit. Also find all the fundamental circuits with respect to the mentioned [7]
spanning tree in the following graph.
b) Prove that every tree has either one centre or two centres. [10]
c) Prove that the number of pendant vertices in a binary tree with 'n' vertices is . [3]
6. a) Find the chromatic polynomial and chromatic number for the following graphs. [10]
(i)
(ii)
b) Prove that a simple graph G on n vertices is a tree if and only if Pn ( ) ( 1) ( n 1) [10]
Page 2 of 2