Scribd
Upload
196 views5 pages

Graph Theory Ques Bank

Uploaded by

sankalp vaish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
196 views5 pages

Graph Theory Ques Bank

Uploaded by

sankalp vaish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Question Bank

Q1. Define Union and Interaction of Graphs with an appropriate examples.

Q2. Show that the complete graph of five vertices is nonplanar

Q3. Prove that the number of vertices of odd degree in a graph is always even.

Q4. Find that the graphs are Hamiltonian or not?

Q5. Draw all the spanning trees of this graph:


Define spanning tree and all the spanning trees of any graph as an example.

Q6. Differentiate between walk and path with appropriate examples.


Q7. Define simple Digraph. What are the applications of Directed Graph?

Q8. Define minimum spanning tree. Use Prim’s and Kruskal’s algorithm to find minimum
spanning tree for this weighted graph G.

Q9. Define with example


A) Matrix representation of graphs
B) Isomorphism
Define matrix representation of graphs. Also give an appropriate example.
Q10. Define Graphs. What are the applications of Graph? Write and plot the “Koingsberg
bridge” problem. Give Euler solution.
Write and plot the “Koingsberg bridge” problem. Also, give Euler solution of this problem.

Q11. Define different types of enumeration of graph.


Q12.
In the following graph, find all shortest paths from A to Z.

Q13. Describe incidence matrix of a graph with an appropriate example.


Q14. Differentiate between planar and nonplanar graph.
Q15. Let G is a graph with 12 edges. If G has 6 vertices each of degree 3 and the rest have
degree less than 3, what is the minimum number of vertices G can have?

Q16. Prove that “The number of vertices of odd degree is always even”.

Q17. Draw all the spanning trees of this graph:

Q18. Differentiate between Edge disjoint subgraphs and vertex disjoint subgraphs with
appropriate example.

Q19. Prove that a given connected graph is an Euler graph if and only if all vertices of G are
of even degree.

Q20. Define minimum spanning tree. Use Kruskal’s and Prim’s algorithm to find minimum
spanning tree for this weighted graph G.

Q21. Define Directed graph. Explain incidence, adjacency and degree in digraphs.

Explain Asymmetric Diagraph and Symmetric Diagraph how diagraphs are used as
Binary Relation. Represents a binary “X divides Y” on set V = {2,3,6,8,24} by diagraph
Q22.

Draw a picture of each of the following graphs, and state whether it is 10


Simple, multigraph, pseudograph.
(a) G1 = (V1,E1), where V1 = {a, b, c, d, e} and E1 = {ab, bc, ac, ad, de}.
(b) G2 = (V2,E2), where V2 = {P,Q,R, S, T} and E2 = {PQ, PR, PS, PT, TR, PR}.
(c) G3 = (V3,E3), where V3 = {v1, v2, v3, v4, v5} and
E3 = {v1v1, v1v2, v2v3, v3v4, v5v4, v4v5}.

Q23. Show that the complete graph of five vertices is nonplanar.


Q24. Define cut set matrix. Also, give an appropriate example.
Q25. Every cut-set ia a connected graph G must contain at least one branch of every
spanning tree of G.

Q26. Prove that there is one and only one path between every pair of vertices in a tree T.
Q27. Every cut-set ia a connected graph G must contain at least one branch of every
spanning tree of G.

Q28. Explain the following operations on graph


(i) union (ii) intersection (iii) Ring sum
Q29. Explain traveling salesman problem with an appropriate example.

Q30. Define walk, closed walk , path and circuit . For each of the following sequences of
vertices, state whether or not it represents a walk, path, closed walk or cycle in the
graph illustrated.
(i ) abcefcbd (ii ) abcefcd (iii ) abcefcdba (iv) bcefcdb
(v) bcdb (vi ) abefcd

Q31. Differentiate between Euler line and Hamiltonian path with appropriate example.

Q32. Prove that a tree with n vertices has n-1 edges.


Q33. Define minimum spanning tree. Use Prim’s and Kruskal’s algorithm to find minimum
spanning tree for this weighted graph G.

Q34. What do you understand the dual of a graph?


Find the dual of the graph given below"
Section C
(Compulsory)
Q35. Define Graph isomorphism Give example of two graphs with same number of vertices
and edges and which have the same sequence of degrees but which are not isomorphic.
Also find the below two graphs are isomorphic or not.

a)

Q36. Prove that there are n (n-2) labeled trees with n vertices.(n ≥ 2)

You might also like