Professional Documents
Culture Documents
1) (a) Find the in degree and out degree of each of the vertices of the following
graph (figure 1) and verify that the sum of in degree = sum of out degree. (b) Find the minimum spanning tree for the following graph (figure 2).
Figure :1 figure :2 2) How to determine whether a graph contains Hamiltonian c y c l e or not using theorem. !) a) "#plain the following with an e#ample i.$F% ii.&F% b) %tate and e#plain "uler's formula. () a) Find the chromatic number of the following graph
rin berg
(.c) *sing +rus+all's algorithm, find a minimal spanning tree for the graph given in the following table. -eight . 1/ 1/ 11 "dges (a, b) (a, d) (b, d) (b, e)
12 (a, e)
12 (c, e)
1! (b, c)
1! (c, d)
1! (d, e)
10 (a, c)