Graph Theory Questions by Module
Module 1: Fundamental Concepts of Graphs
1. Show that the maximum number of edges in a simple graph with n vertices is n(n-1)/2
2. Show that a simple graph with n vertices and k components can have at most (n-k)(n-k+1)/2 edges
3. Distinguish between Complete graph and Complete Bipartite graph
4. Verify whether the following graphs are isomorphic or not
5. Define graph? What are the real life applications of graphs. List the types of graphs & explain in brief
6. Differentiate between finite & infinite graphs with examples. Explain the concept of bipartite graphs
7. Define incidence & degree in the context of graphs. Find the degree of each vertex in a given graph
8. Define: (i) Walk (ii) Path (iii) Circuit with an example for each
9. If a connected graph G is decomposed into two subgraphs g1 and g2, then prove that there must be at
least one vertex common between g1 and g2
10. Prove that the number of vertices of odd degree in a graph is always even
11. Define the following with an example: i) Regular graph ii) Complete graph iii) Complete Bipartite graph
12. Explain the following graphs: (i) Bi-partite graph (ii) Sub graphs (iii) WALK (iv) Path
13. Define the following: i) walk ii) open walk iii) path iv) circuit v) cycle vi) Trail
14. Define i) Isomorphism ii) Subgraph iii) Pendent vertex with an example for each
15. Define isomorphic graph and verify if given graphs are isomorphic or not
16. Consider a given graph G and: (i) Identify its type, (ii) Find its pendant vertices, (iii) Determine the number
of components, (iv) Find the minimum degree, delta(G), (v) Find the average degree, d(G), and (vi) Draw two
vertex disjoint subgraphs
17. Find the number of vertices for a graph G = (V, E) in given cases, such as when G has 9 edges and all
vertices of degree 3, or is a cubic graph with 9 edges, or has 10 edges with 2 vertices of degree 4 and others
of degree 3
18. Explain Konigsberg bridge problem of graph theory
19. Explain any Five applications of graphs
Graph Theory Questions by Module
Module 2: Eulerian and Hamiltonian Graphs, Digraphs
1. What is Travelling Salesman Problem? Explain its significance in graph theory and give an example
2. Prove that a connected graph G is an Euler graph if and only if all vertices of G are of even degree
3. By specifying the walk, draw two Euler graphs and an Unicursal graph
4. Define Hamiltonian circuit and Hamiltonian path. Give an example for each. Also, draw a graph that has a
Hamiltonian path but not a Hamiltonian circuit
5. Discuss about any four types of digraphs with suitable examples
6. Show that a graph has an Eulerian trail if it has exactly two vertices of odd degree
7. Define Hamiltonian cycle. How many edge-disjoint Hamiltonian cycles exist in a complete graph with 5
vertices? Draw the graph to show and specify the cycle
8. If all the vertices in a connected graph G are of even degree, then show that G is Eulerian
9. Discuss relationship between digraphs and binary relations with suitable examples
10. State and prove the necessary condition for a graph to be an Euler graph
11. Define Euler circuit, Euler trail, and Euler graph
12. Show that a connected graph G has an Eulerian trail if and only if there are exactly two vertices of odd
degree in G
13. In a complete graph with n vertices (n is odd and >= 3), prove that there are (n-1)/2 edge-disjoint
Hamiltonian circuits
14. Define Hamilton graph. By specifying the walk, draw a graph which contains: i) Both Euler circuit and
Hamilton cycle, ii) Euler circuit but no Hamilton cycle, iii) Hamilton cycle but no Euler circuit, iv) Neither a
Hamilton cycle nor an Euler circuit
15. Define digraph and find the indegree and outdegree of a given graph
16. List and explain different digraphs and binary relations
17. Define directed graph. Prove that in any digraph the sum of the in-degrees of all vertices is equal to the
sum of their out-degrees, and this sum is equal to the number of edges in the digraph
Graph Theory Questions by Module
18. Define Binary relation. Represent a given relation R defined on a set A by the phrase 'is a factor of' in a
digraph
19. Draw a complete symmetric digraph and a complete asymmetric digraph with 4 vertices
20. List and explain the different operations on graph
21. Illustrate the travelling salesman problem using a graph
22. Given a graph with weights representing distances between cities, determine the optimal route for a
salesman visiting every city exactly once and returning home, keeping total travel to a minimum
