Part-III

Attempt any Four:-

(4*4=16)
1. Prove that for a given spanning tree T a chord Ci that determines a
fundamental circuit occurs in every fundamental cut set
associated with branches in and no other.
2. Explain Kruskal’s algorithm with example.
3. What is cut set. Prove that every cut set in graph must have at least
B. Tech. (C.S. 6th Sem) one branch of a spanning tree.
Second Sessional Examination 4. Define fundamental Cut set and Fundamental Circuit. Show with
Subject Name: Graph Theory example.
5. Explain Chromatic polynomial.
Time Duration: 2 hours Part-IV
M.M. : 50 Attemp any two:-
Part-I (2*5=10)
Attempt Any Four Questions:- 1) Prove that a connected planar Graph with n vertices and e edges
(4*3=12) have (e-n+2) regions.
1. Explain the following with example 2) What do you understand by a vector space of a graph. Also explain
A. Graph subspace and find the Vc (Circuit Subspace) and Vs (cut set
B. Subgraph Subspace) of following graph:
C. Tree
2. Explain Combinatorial representation of graph.
3. Show that the sum of degree of all vertex in graph is twice the number
of edges.
4. Give Kuratowski’s two graph. Are they planar?
5. What is incidence matrix give example.
6. What do you mean by proper coloring of a graph? Also explain 3) Prove that a simple graph with n vertices and k components can
Chromatic Number.. have at most (n-k)(n-k+1)/2 edges.

Part-II
Attempt Any Four Questions:-
(4*3=12)
1. Prove that sum of degree of any finite graph is always even.
2. Discuss Travelling Salesman Problem.
3. Define following operations on a Graph with example
A. Union
B. Intersection
C. Ring Sum
4. What is Spanning tree? Give example also explain Branch and Chord.
5. What Do you mean by isomorphic graph? Given graphs are isomorphic
or not