1. Explain utilities problem in graph theory.

(5 M) (CO5,L2)
2. Define isomorphism and write the isomorphic graphs of the graphs. (5 M)
(CO3,L1)

3.

an
d

4. Construct a graph with five vertices and seven edges write degrees of all vertices and
n
∑ d (vi)
verify the result i=1 =2e (5 M)
(CO5,L6)
5. If G1 & G2 are two connected graphs then find G 1 ∪G 2 , G 1∩G 2 and G 1 ⊕ G2

G1 G2

6. Write the fundamental circuit matrix of the two graphs (5 M) (CO4,L1)

 i.

7. The graph square find (5 M) (CO6,L3)

8. Define a complete graph and
9. In the graph G1 write G1-Vi (where vi is the vertex of degree 5)
10. In the graph G2 write the fusion of a and b (5 M) (CO5,L1)

G1 G2

11. Prove that in a tree with n vertices has an n-1 edges. (5 M) (CO2,L2)
12. Prove that every tree has either one or two centers. (5 M)(CO4,L2)
13. Find the maximum and minimum level of the tree, using the formulas also trace the
trees. (5 M) (CO3,L3)

14. Write the incident matrix of the given graph and mention few observations.
 i.
15. Define Homeomorphic graphs and Geometric dual with example.(5M) (CO2,L1)
16. Prove that the rank is equal to the number of branches in a spanning tree and nullity is
equal to the number of chords in a spanning tree. (5M) (CO2,L3)
17. Write the cut set matrix of the graph and write few properties. (5M) (CO3,L6)

a.

18. For the given graphs find

a.
b. *G1 union G2
c. *G1 intersection G2
d. *G1 ring sum G2
 G2-V3
e. *G1-C (5M)
(CO3,L3)
19. Write the circuit matrix of the graph and mention few properties.(5M) (CO2,L6)
 i.
20. Define path length of a tree with example. (2M) (CO6,L1)
21. Define centre of a tree with example. (2M)
(CO5,L1)
22. Define cyclic group with example. (2M) (CO1,L1)

23. Write all possible ω Γ and

ω S vectors in the graph. (2M)
(CO3,L6)

a.
24. A tree having 17 vertices find *the number of edges *the number of pendent vertices
*number of internal vertices *number of vertices of degree three*maximum level*
minimal level (5M)
(CO4,L3)
25. Prove that the complete graph of five vertices is nonplanar. (5M)
(CO2,L1)
26. If G is a group in which (ab)n=an.bn for three consecutive integers n, for all a , b ∈ G ,
then show that G must be abelian. (5M) (CO1,L1)
27. State Fermat’s theorem and prove it using group theory. (5M) (CO2,L1)

28. Define Hamiltonian circuit with example. (2M) (CO1,L1)

29. In 3D plane using GF2 how many vector space points are possible, write it
i. (2M) (CO5,L6)
30. Define walk and path. (2M)
(CO3,L1)
31. Write the fussion of the vertex v2 on v1 for the graph
 i. (2M) (CO4,L6)
32. Define basics vectors and write the natural basis. (2M) (CO2,L1)
33. Write a note on Galoi’s field under modulo 2. (2M) (CO3,L6)
34. Write the path matrix of the graph (2M) (CO1,L6)

i.
35. Define orthogonal vectors with example. (2M) (CO4,L1)
36. Define unicursal graph. With example. (2M) (CO4,L1)

37. In 7D plane how many vector spaces are possible to write using GF2.
i. (2M) (CO4,L6)
38. Write addition and multiplication tables for GF2. (2M) (CO2,L6)
39. Write the duel graphs of the following. (2M) (CO4,L6)

a.
40. Write Kuratowski’s second non planar graph. (2M) (CO1,L2)
41. Define binary tree with example. (2M) (CO2,L1)
42. A tree contains 13 vertices find the number of pendent vertices and number of vertices
of degree 3. (2M) (CO5,L3)
43. Define path length and find the path length of the above tree. (2M) (CO2,L1)
44. Write natural or standard basis in graph theory. (2M) (CO3,L5)

45. Define spanning tree, forest , chords, branches and write the spanning tree of the graph.

i. (5M)(CO3,L1)

46. Write the algorithm for shortest spanning tree. (5M) (CO2,L6)
47. Prove that the ring sum of any two cut-sets in a graph is either a third cut-set or an
edge-disjoint union of cut-sets. (5M) (CO3,L3)
48. Write the geometric duel of the graph and mention few properties. (5M)
(CO4,L6)

i.
49. Show that the set { ( 0,1,1 )( 1,0,1 )( 1,1,0 ) } spans R and write the vector (2,4,8) as a linear
3

combination of vectors in S. (5M)

(CO4,L1)
50. In the following graph, show that: Rank=number of branches in a spanning tree, and
nullity=the number of chords in G, also Rank+nullity=number of edges in G.
i. (5M) (CO6,L3)

ii.

51. Write the ring sum of the two graphs and represent it in GF(2).

i. (5M)
(CO2,L6)
52. Give an example for linearly independent vectors in graph theory. (5M) (CO4,L1)
53. Find the maximum and minimum level of the tree using formulas and trace the trees
(5M) (CO4,L3)

i.
54. Find the number of edges, number of pendent vertices, number of vertices of degree 3,
and number of internal vertices of the above graph using formulas and also name the
above graph. (5M) (CO1,L3)
3
55. Show that the set S={(0,1,1),(1,0,1),(1,1,0)} spans R and write the vector (2,4,8) as a
linear combination of vectors in S. (5M) (CO3,L3)
¿
56. For any simple graph prove that : Rank of ( G −h ) =Rank of G¿−nullity of g
i. (5M) (CO4,L1)

57. Prove that the complete graph of 6 vertices is nonplanar. (5M) (CO1,L1)