Scribd
Upload
2 views

graph theory question

This document is a question bank for a Graph Theory course, specifically for the III BSC - V Semester. It includes a variety of questions covering fundamental concepts such as theorems, definitions, graph properties, and examples related to graphs, trees, Eulerian and Hamiltonian graphs, and isomorphism. The questions are designed to test understanding and application of graph theory principles.

Uploaded by

Sufiyan 2173
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

graph theory question

This document is a question bank for a Graph Theory course, specifically for the III BSC - V Semester. It includes a variety of questions covering fundamental concepts such as theorems, definitions, graph properties, and examples related to graphs, trees, Eulerian and Hamiltonian graphs, and isomorphism. The questions are designed to test understanding and application of graph theory principles.

Uploaded by

Sufiyan 2173
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

III BSC - V SEMESTER - GRAPH THEORY – QUESTION BANK

1. State and prove first theorem of Graph theory


or
State and prove Hand shaking lemma.
2. Show that the number of vertices of odd degree in a graph is even.
3. Verify =2m for the following graphs and also find isolated vertex and end vertices of
the graph.

4. Define the following with an example.


(a) a finite graph (b) a simple graph (c) a multigraph (d) a null graph
(e) Regular graph (f) Complete graph Kn (g) Complete bipartite graph Km,n
(h) a cycle (i) Tree (j) a pseudograph
5. Draw a graph with 6 vertices and 10 edges .
6. Define minimum degree and maximum degree of graph G. If n represents order and
m represents size of graph G then prove that

7. Define subgraph of graph G. Differentiate between induced subgraph and spanning subgraph with
an example
8. Define induced subgraph and spanning subgraphs. Draw all spanning subgraphs of K3.
9. Obtain an induced subgraph and spanning subgraph of the following Graph.

10. Define connected graph and disconnected graph. If G is disconnected graph then prove that is
connected.
11. Prove that every connected graph has atleast one spanning tree.
12. Define isomorphism between any two graphs with an example.
13. Give an example of non-isomorphic graphs.
14. Verify whether the following graphs are isomorphic.

15. Define Complement of a graph and draw the complement of the following graphs
16. Obtain the complement of the following graphs

17. Show that the given graphs are 2-isomorphic

18. Show that every u-v walk contains a u-v path.


19. If G and H are isomorphic graphs then prove that the degree of vertices of G is same as degree of
Vertices of H

20. If : and K2: , .


21. Draw the graphs and Also, find the number of edges present in them. Is K5 a regular
graph?
22. Define Union and intersection of any two graphs with an example.
23. Define the following graphs and give an example.
(i) Eulerian graph
(ii) Hamiltonian graph
(iii) a walk
(iv) a path
(v) induced subgraph
24. Define a tree. Prove that a tree with n vertices has n-1 edges.
25. Show that a graph G is a tree if and only if every two distinct vertices of G are joined by a unique
path of G.
26. Write a Hamiltonian path and Hamitonian cycle for the graph.

27. Draw all possible trees that can be constructed with 5 vertices.
28. Define Eulerian graph and Hamiltonian graph with an example.
29. Give an example for each of the following.
(i) A graph G which is both Eulerian and Hamiltonian.
(ii) A graph G which is Eulerian but not Hamiltonian.
(iii) A graph G which is Hamiltonian but not Eulerian.
(iv) A graph G which is neither Hamiltonian nor Eulerian
30. State one application where Eulerian and Hamiltonian graphs are used.
31. Find eccentricities of all vertices of the following graphs.

32. Find the number of spanning trees in the graph.


33. Define self-complementary graph. Show that the graph is self-complementary.
34. Prove that every self-complementary graph has 4n or 4n+1 vertices.
35. Which of the following graphs are Eulerian.

36. Show that the graph is Eulerian when both m and n are even .
37. Which of the following graphs are Hamiltonian.
38. Prove that if a (p, q) graph is connected then q  p – 1.
39. Find the centre of the following graphs

40. Prove that a (p, q) graph is a complete graph if and only if .

*********

You might also like