b)

a)

b)
a)

b)

00000CS309121902

Check whether the two graphs are isomorphic or not. Justify your answer.

Prove that in a complete graph with n vertices there are (n-1)/2 edge disjoint
Hamiltonian circuits, if n is an odd number >=3
Explain arbitrarily traceable graphs with suitable examples.
Is it possible to have simple graphs with the following degree sequences?if
yes,draw the graphs

a) 2,3,3,3,3,3,4,5

0) 1,3,3,4,5,6,6

०) 1,2,3,3,4,5,6
Explain digraphs and binary relation on digraphs.

PART C
Answer all questions, each carries 3 marks.

Prove that in a graph G, if there is exactly one path between every pair of vertices,
then G is a tree.

Define rooted binary tree. Find the path length of the following tree

(5)

(5)

(4)
(5)

(4)

(3)

(3)