Graph Theory Question Bank with Checkboxes

Module 1
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. [ ]

Module 2
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. [ ]

Module 3
1. Define Fundamental Circuit. If G is a graph with n vertices and q edges, then find the number of

fundamental circuits in the graph. [ ]

2. Show that for any graph G, the vertex connectivity cannot exceed the edge connectivity and the

edge connectivity cannot exceed the degree of the vertex with the smallest degree in G. [ ]

3. Define vertex connectivity and edge connectivity. Give the relation between them. [ ]

4. Prove that every circuit has even number of edges in common with a cut-set. [ ]

5. Define a tree and list its properties. What is pendant vertex? Explain with examples. [ ]

6. Differentiate between rooted tree and a binary tree. What is complete binary tree? How is it

different from full binary tree? [ ]

7. Write a short note on spanning trees and counting trees. [ ]

8. Define cutset and cut vertices. How do they impact the structure of a graph. [ ]

9. What are fundamental circuits? Discuss the importance of fundamental circuits in graph theory. [

10. For any Spanning tree of a connected graph with n vertices and e edges, prove that there are

n-1 tree branches and e-n+1 chords. For the following graph, find two spanning trees and hence

show that an edge that is a branch of one spanning tree can be a chord with respect to another

spanning tree of same graph. [ ]

Module 4
1. State and prove Euler's formula that gives the number of regions in any planar graph. [ ]

2. Describe the steps to find adjacency matrix and incidence matrix for a directed graph with a
simple example. [ ]

3. State Kuratowski's Theorem and use it in order to prove the graph given below is non-planar. [ ]

4. Give two conditions for testing planarity of a given graph. Sketch a sample graph for planar graph

and non-planar graph. [ ]

5. I) Show that Petersen graph is non-planar. II) Let G be a planar graph. Then prove that it contains

a vertex of degree at most 5. [ ]

6. Define the following: (i) Planar graph (ii) Embedding (iii) Non-planar (iv) Kuratowski's 2 graph. [ ]

7. Explain the simple observation mode relationship between planar graph dual G. [ ]

8. Write a note on path matrix. Prove that two graphs G1 and G2 are isomorphic if and only if the

incidence matrices A(G1) and A(G2) differ only by permutations of rows and columns. [ ]

9. Describe the observations that can be made about circuit matrix B(G) and graph G. [ ]

10. Adjacency matrix and incidence matrix problems. [ ]

Module 5
1. Prove that every tree with two or more vertices is 2-chromatic. [ ]

2. Explain the following for chromatic polynomial: (i) Finding a maximal independent set (ii) Finding

all maximal independent set. [ ]

3. Prove that the vertices of every planar graph can be properly colored with five colors. [ ]

4. Explain the Greedy colouring algorithm. [ ]

5. State and prove four color theorem. [ ]

6. Define chromatic number of a graph. Find the chromatic polynomial and chromatic number for the

given graph. [ ]

7. Define Matching and complete matching. Obtain two complete matchings from the given graph. [

8. Prove that an n-vertex graph is a tree if and only if its chromatic polynomial is P_G(lambda) =

lambda(lambda-1)^(n-1). [ ]

9. Define Covering and minimal covering of a graph. Obtain two minimal coverings from the given

graph. [ ]
10. State and prove Five color theorem. [ ]
Additional Graph Theory Questions (Supplement)

Module 1: Fundamental Concepts of Graphs

1. Define the following with an example: i) Regular graph ii) Complete graph iii) Complete Bipartite graph
2. Define the following: i) walk ii) open walk iii) path iv) circuit v) cycle vi) trail
3. Define: i) Isomorphism ii) Subgraph iii) Pendent vertex with example for each
4. Consider a given graph G and: (i) Identify its type (ii) Find its pendant vertices (iii) Determine number of components (iv) Fin
5. Find number of vertices for graph G = (V, E) in cases such as: 9 edges and all vertices of degree 3, etc.
6. Explain the Konigsberg Bridge Problem.
...

Module 5: Graph Colouring, Matching, and Covering

1. Define Chromatic number. Prove that a graph with at least one edge is 2-chromatic if and only if it has no circuits of odd leng
2. Prove that a graph of order (n ≥ 2) consisting of a single circuit is 2-chromatic if n is even and 3-chromatic if n is odd.
3. Explain how to find a maximal independent set and all maximal independent sets for a chromatic polynomial context.