Most Repeated Questions in Graph Theory (Exam Preparation)
Module 1: Fundamental Concepts & Basic Graph Properties
1. Prove that the number of vertices of odd degree in a graph is always even.
2. Determine whether two given graphs are isomorphic or not.
3. Define and explain fundamental graph terminology with examples: Walk, Path, Circuit, Trail, Isomorphism,
Subgraph, Pendent vertex, Bi-partite graph, Regular graph, Complete graph, Complete Bipartite graph.
4. Show that the maximum number of edges in a simple graph with `n` vertices is `n(n-1)/2`. Also, related
concept: simple graph with `n` vertices and `k` components can have at most `(n-k)(n-k+1)/2` edges.
Module 2: Eulerian and Hamiltonian Graphs & Digraphs
1. Prove that a connected graph G is an Euler graph if and only if all vertices of G are of even degree.
2. Define Hamiltonian circuit and Hamiltonian path. Also, draw a graph that has a Hamiltonian path but not a
Hamiltonian circuit.
3. In a complete graph with `n` vertices (odd `n` >= 3), prove that there are `(n-1)/2` edge-disjoint Hamiltonian
circuits.
4. Prove that in any digraph, the sum of in-degrees of all vertices is equal to the sum of their out-degrees,
equal to the number of edges.
5. Illustrate the Travelling Salesman Problem using a graph.
Module 3: Trees, Spanning Trees, Connectivity & Cut-Sets
1. Prove that a connected graph G is a tree if and only if there is one and only one path between every pair of
vertices.
Most Repeated Questions in Graph Theory (Exam Preparation)
2. Prove that a tree with `n` vertices has `n-1` edges.
3. Prove that there are at least two pendent vertices in a tree with two or more vertices.
4. Define Vertex Connectivity and Edge Connectivity. Prove that vertex connectivity <= edge connectivity <=
smallest vertex degree.
5. Prove that every circuit has an even number of edges in common with any cut-set.
6. Define Spanning Trees, branches, and chords. Prove: spanning tree of `n`-vertex connected graph with `e`
edges has `n-1` tree branches and `e-n+1` chords.
Module 4: Planar Graphs & Graph Representation
1. Define planar and non-planar graphs. State Kuratowski's Theorem and draw K5, K3,3.
2. State and prove Euler's formula for planar graphs: `e - n + 2`. Also show `e <= 3n - 6` for simple planar
graphs.
3. Draw the Adjacency Matrix and Incidence Matrix for given graphs. Understand Path Matrix and Circuit
Matrix.
4. Define and draw the Geometric Dual of a graph.
Module 5: Graph Colouring, Matching & Covering
1. Define Chromatic Number and Chromatic Polynomial. Frequently find them for given graphs.
2. Prove that every tree with two or more vertices is 2-chromatic. Also prove: `P_n(lambda) =
lambda(lambda-1)^(n-1)` <=> tree.
3. State and prove the Five-color Theorem. State and prove Four-color Theorem as well.
Most Repeated Questions in Graph Theory (Exam Preparation)
4. Write a note on the Greedy Colouring Algorithm.
5. Define Complete Matching and Minimal Covering. Obtain examples for given graphs.
