ANNAI MIRA COLLEGE OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF MATHEMATICS
QUESTION BANK

SUBJECT NAME : Graph Theory (CSE / III YEAR)

SUBJECT CODE : OMA351
REGULATION : 2021
PREPARED BY :Mr. M.KARUNAIVEL(Asst.Prof in Mathematics)

UNIT I –INTRODUCTION TO GRAPHS

PART-A
1. 1Define complete graph and draw c5 Nov/Dec-2019 Dec/Jan-2022
.
2. 2 Define a regular graph. Can a complete graph be a regular graph? Nov/Dec-2018
.
How many edges are there in a graph with 10 vertices each of degree Nov/Dec-2019
3. 3 6?Dec/Jan-2022
.
4. . Define pseudo graphs. Nov/Dec-2018
5. 5 Define strongly connected graph.Dec/Jan-2022
.
6. 6 State the handshaking theorem. Apr/May-2021
.
7. 7 Prove that the number of odd degree vertices is always even. Apr/May-2019
.
8. 9 Define isomorphism of directed graph
.
9. 1 Define connected graph and a disconnected graph with example.
0
.
10. 1 Let G be the graph with 10 vertices. If four vertices has degree four and
1 six vertices has degree five , then find the number of edges of G. Apr/May-2021
.
11. 1 How many edges does a graph have if it has vertices of degree
2 5, 2, 2, 2, 2, 1? Draw such a graph.
.
0 1 0
12. 1 Draw the graph with the following adjacency matrix(1 0 1) Apr/May-2019
4 0 1 0
.
13. 1Represent the given graph using an adjacency matrix.
5
.

14. 1Define simple graph with an example.

6
.
15. 1Draw a parallel edge graph.
7
 .

What is directed graph and undirected graph.

16.

17. Define connected graph with an example.

18. Define Regular graph with an example.
19. What is complete graph? Give an example for that.
20. Define complete bipartite graph with an example.
21. Define graph.
22. 2Define Loop.
23. Define Pseudo graph.
24. Define complete graph.
25. Define Regular graph.

PART-B
Find the number of paths of length 4 from the vertex D to E in the undirected graph given
below. Apr/May-2019 Dec/Jan-2022

1.

Examine whether the following two graphs G and G’ associated with the following adjacency
matrices are isomorphic. Nov/Dec-2019 Apr/May-2021 Dec/Jan-2022
0 1 0 1 0 0 0 1 0 0 1 0
2. 1 0 1 0 0 1 1 0 1 0 0 0
0 1 0 1 0 0and 0 1 0 1 0 1.
1 0 1 0 1 0 0 0 1 0 1 0
0 0 0 1 0 1 1 0 0 1 0 1
[0 1 0 0 1 0] [0 0 1 0 1 0]
Define isomorphism .Establish an isomorphism for the following the

3.

graphs. Nov/Dec-2018

4. Prove that the complement of a disconnected graph is connected. Apr/May-2019

5. ISOMORPHIC OR NOT ? Nov/Dec-2019

Define Isomorphism between the two graphs. Are the simple graphs with the following adjacency
matrices isomorphic?
6. 0 1 0 0 0 1 0 1 0 0 0 1
1 0 1 0 1 0 1 0 1 0 0 1

0 1 0 1 0 1 and 0 1 0 1 1 0
0 0 1 0 1 0 0 0 1 0 1 0
0 1 0 1 0 1 0 0 1 1 0 1
[1 0 1 0 1 0] [1 1 0 0 1 0]
7. If a graph G has exactly two vertices of odd degree there is a path
joining these two vertices. Nov/Dec-2018

8. Define 1. Complete graph. 2. Complete bipartite graph with example. Apr/May-2019

9. How many paths of length four are there from Nov/Dec-2018

Using adjacency matrix examine whether the following pairs of graphs

10. given below are isomorphism or not. Apr/May-2021

11. Draw the complete graph 𝐾5 with vertices A, B, C, D, E. Draw all

complete sub graph of C5 with 4 vertices. Apr/May-2021 Dec/Jan-2022

12. The sum of all vertex degree is equal to twice the number of edges (or)
the sum of the degrees of the vertices of is even. Dec/Jan-2022

13. 𝑛 (𝑛−1)
Prove that the maximum number of edges in a simple graph with 𝑛 vertices is
2

14. Draw 𝑘1, 𝑘2, 𝑘3, 𝑘4 and 𝑘5 graphs.Dec/Jan-2022

15. Find the adjacency matrix of the following two graphs. Nov/Dec-2019

16. Determine whether the following graphs G and H are isomorphic. Give reason.

17. (𝑛−𝑘)(𝑛−𝑘+1)
A simple graph with n vertices and k components can have atmost Nov/Dec-2019
2

18. State and Prove Hand Shaking Theorem.

19. (𝑛−1)(𝑛−2)
Prove that a simple graph with n vertices must be connected if it has more than
2

20. Define Adjacency matrix with an example.

21.

NOV/DEC 2017--GTA
22. Define graph isomorphic and also find isomorphic or not?
 NOV/DEC 2017--GTA
23. Check whether the two graphs given are isomorphic or not.

NOV/DEC 2017--GTA
24.

25. a(i) Define and example of (a)Pseudo graph(b)Complete graph(c)Directed, undirected graph(d)C7 (e)Complete
bipartite graph (f)walk, path and cycle. (g) Define graph isomorphic (
26. Define graph isomorphic and also find isomorphic or not?

1. (OR)

NOTE: (i). For scoring (50-59) study S.No.(1-12) in part-A and S.No. (1-14) in part-B.
(ii). For scoring (60-79) study S.No.(1-18) in part-A and S.No. (1-20) in part-B.
(iii). For scoring 80 & above study S.No.(1-25) in part-A and S.No. (1-26) in part-B.
 UNIT 2 TREES AND CONNECTIVITY
PART-A
1. Define Binary tree.

2. What is meant by complement of a graph ? Find the complement of the C5 graph

3. Draw at least 3 non-isomorphic graphs on 4 vertices.

4. Define n-regular graph. Show for which value of n the following graphs are regular :

5. Distinguish between strongly connected digraphs and weakly connected graphs with examples.

6. Define Graph and Subgraph. Give an example of a subgraph H

7. Draw all unlabelled trees with 5 vertices.

8. Define : 4(i) Graph (ii) Simple Graph (iii) null graph (iv) connected Graph

9. Define planar graph and non-planar graph with examples.

10. Can a simple graph exist with 15 vertices, with each of degree five ? Justify your answer.

11. Construct a 5-regular graph on 10 vertices

12. Define Tree.

13. Show that a Hamiltonian path is a spanning tree

14. Define spanning tree.

15. Define Metric.

16. Define Minimally connected graph.

17. Define Rooted tree

18. What is the maximum and minimum height of a binary tree with 15 vertices.

19. Can you draw a tree with 3 vertices having degree 1,2,2,2

20. What is edge connectivity?

 PART-B
1.

2.

3. Show that In a graph G ,there is one and only one path between every pair of vertices, then G is a tree.

4. Show that a tree with n -vertices has n-1 edges

5. Show that In any tree, there are at least two pendant vertices.

6. Show that In a graph G ,there is one and only one path between every pair of vertices, then G is a tree.

7. Identify two spanning trees for the following graph : (A/M-17)A 1

9 D
8. Every connected graph has atleast one spanning tree .(8 mark).

9. Show that a path is its own spanning tree.(8 mark)

10. Show that a Hamilton path is a spanning tree.(8 mark).

11. A graph is a tree iff it is minimally connected.(8 mark).

12. Define fundamental cut-sets with an example.(6 mark).

13. The ring sum of any two cut-sets in a graph is either a third cut-sets or an edge-disjoint union
of cut-sets.(10 mark).
14. A vertex v in a connected graph G is a cut –vertex iff there exists two vertices x and y in G
such that every path between x and y passes through v.(8 mark).

15. Is the directed graph given below strongly connected? or not?

16. What are the maximum, minimum height of a binary tree with n=15

17. 𝑛−2(𝑛−3)
If G is simple graph with vertices k components then it can have at least 2

18. (iv)Give brief explain

19. Prove that every tree has either one or two centre

20. What are the maximum,minimum height of a binary tree with n=11 veritces and Draw tree
 𝑛−1!
21. show that comlete graph kn contains
2

22. Check Whether

NOTE: (i). For scoring (50-59) study S.No.(1-12) in part-A and S.No. (1-14) in part-B.
(ii). For scoring (60-79) study S.No.(1-16) in part-A and S.No. (1-17) in part-B.
(iii). For scoring 80 & above study S.No.(1-20) in part-A and S.No. (1-22) in part-B.

UNIT 3 TRAVERSABILITY
PART-A
1. Give an Example of a bipartite graph which is Hamiltonian but not
Eulerian.
2. Draw(i)Hamiltonian cycle but not Euler cycle

3. (ii)Draw Both or Hamiltonian cycle

4. What should be the degree of each vertex of a graph G if it has

Hamilton circuit?
5. Define complete bipartite graph .

6. State the necessary and sufficient conditions for the existence of an

Eulerian path in a connected graph.
7. For which values the graphs have an Euler path but no Euler circuit?

8. Represent the given graph using an adjacency matrix.

 9. Does the graph have a Hamilton path? If so find such a path.
1.

10. Define Euler’s graph.

11. State Dirac theorem

12. State Ore’s theorem

13. Define Hamiltonian graph.

14. Define Euler’s path.

15. Define Hamiltonian path.

16. Explain Euler’s circuit.

17. Explain Hamiltonian circuit.

18. Define Euler trail

19. Define walk, path and circuit in a graph (N/D-16).

20. . What is meant by eccentricity? (N/D-16).

PART-B

1. Derive a connected graph has an Euler trail if and only if it has at most
two vertices of odd degree. Nov/Dec-2018
2. Give an example of a graph which is 1. Eulerian but not Hamiltonian 2. Hamiltonian but not
Eulerian 3. Hamiltonian and Eulerian 4. NeitherHamiltonian nor Eulerian Apr/May-2019
3. Find an Euler path or an Euler Circuit if it exists, in each of the three graphs given below. Nov/Dec-
2019

4. Prove that the following statements are equivalent for a simple

connected graph.1.G is Eulerian. 2. Every vertex of has even degree. Apr/May-2021
5. Give an example of a graph which is
(a) Eulerian but not Hamiltonian
(b)H amiltonian but not Eulerian

Let G be a simple connected graph. If there exists non adjacent vertices u and v such that
6. d(u)+d(v)≥n , then G is Hamiltonian iffG+uv is Hamiltonian

7. State and prove Dirac theorem

8. State and prove Ore’s theorem

9. State and prove necessary and sufficient condition for Hamilton path, Hamilton cycle

10. State and prove necessary and sufficient condition for Euler path, Euler cycle

11. Define walk, path and circuit in a graph (N/D-16).

12. Define Euler graph. Show that an Euler graph is connected except for any isolated vertices the graph may
have. (A/M-17)
13. Can there be a path longer than a Hamiltonian path (if any) in a simple, connected, undirected graph?
Why?(A/M-17)
14. Check whether the following degree sequence are graphic or not 4,3,2,2,1 and 4,3,3,3,2,2,2,1

15. Check whether the graph is Hamilton or not

16. Define and example of Distance, Eccentricity,Radius,Central point Find the Distance of a
graph,Eceentricity,Radius,Central point

17. Which of the following are Euler and Hamilton Graphs

 18. Prove that A given connected graph G is an Euler graph iff all vertices of G are of even degree.

19. Which of the following graphs are Hamiltonian cycle Or Hamilton path, Euler path or euler cycle from
octahedron,K5,K3,
20. Characterization of euler graphs

NOTE: (i). For scoring (50-59) study S.No.(1-10) in part-A and S.No. (1-13) in part-B.
(ii). For scoring (60-79) study S.No.(1-15 in part-A and S.No. (1-16) in part-B.
(iii). For scoring 80 & above study S.No.(1-20) in part-A and S.No. (1-20) in part-B.

UNIT 4 PLANARITY AND COLOURING

PART-A
1. Define coloring

2. Define Fundamental cut-set. Give an example.

3. Define Separability.

4. Define planar Graph.

5. .Define non-planar graph.

6. Define 1-isomorphism and 2-isomorphism.(N/D-16).

7. What are the applications of planar graph? (N/D-16).

8. Define planar Graphs with ex. (A/M-17).

9. Define minimal dominating set and maximal independent set. (N/D-16)

 10. Find the chromatic number of a complete graph of n vertices. (N/D-16)

11. Does the following graph have a maximal matching ? Give reason.(A/M-17)
1 a

2 b
c
3
d
e

12. Draw 𝐾8 and 𝐾9 and show that thickness of 𝐾8 is 2 while thickness of 𝐾 9 is 3.(A/M-17)

13. In a directed graph,when do we say a vertex is isolated.

14. Define Euler digraph.

15. What is the upper limit of the chromatic number?

16. Define chromatic number.

17. Define directed graph and undirected graph.

18. Define proper colouring

19. Prove that K5 and K3,3 are non planner a

20.

PART-B
1. Find the chromatic number of

2. Determine the chromatic number of the following graph.

a
f

e c
3. A graph G is 2-chromatic iff G is bipartite.

4. If G is a tree with n vertices then show that its chromatic polynomial is

𝑝𝑛 (𝜆) = 𝜆(𝜆 − 1)𝑛−1 .
5.

6. Prove that K5 and K3,3 are non planner a

7. Define Planar graph and prove that a connected graph with n vertices and e edges has e- n+2

8.

9. Show that the digraphs are isomorphic or not

10. Prove that every tree two or more vertices is 2-chromatic

11. Prove that a graph of n vertices is a complete graph iff chromatic polynomial is 𝑃𝑛 (𝜆) =
𝜆(𝜆 − 1)(𝜆 − 2) … … . (𝜆 − 𝑛 + 1)
12. State Four colour problem

13. Prove that a graph G at least one edge is 2 chromatic graph iff has no circuit of odd degree length

14. Find the chromatic number of the graph

 𝑘(𝑛−2)
15. If every region of simple planner graph embedded in a plane is bounded by k edges show that e= 𝑘−2

2𝑒
16. Prove that max vertex connectivity of G is e edges is the integral part of 𝑛

17.

18.

19.
 20.

21.

NOTE: (i). For scoring (50-59) study S.No.(1-12) in part-A and S.No. (1-14) in part-B.
(ii). For scoring (60-79) study S.No.(1-18) in part-A and S.No. (1-20) in part-B.
(iii). For scoring 80 & above study S.No.(1-25) in part-A and S.No. (1-26) in part-B.

UNIT 5 OPTIMIZATION GRAPH ALGORITHMS

PART-A
1. What is Branches and chords

2. . Define Rank and nullity.

3. . State Max-Flow and Min –cut theorem and give an example.

4. . Define 2- isomorphism.

5. Define 1-isomorphism.

6. Define Max-Flow and Min –cut theorem

7. Distinguish between strongly connected digraphs and weakly connected graphs with examples

8. Prove that there is one and only one path between every pair of vertices in a tree

9. Draw all unlabelled trees with 5 vertices.

 10. Prove that the edge connectivity of a graph cannot exceed the degree of the vertex with the
smallest degree in G.

11. Define planar graph and non-planar graph with examples

12.

PART-B
1.

2.

3. State and prove Max-flow and Min-cut theorem.(8 mark)

4. State and prove Max-flow and Min-cut theorem with example .(8 mark)

5.

6.
Use Prims find minimal spanning tree for
7. Explain about kuratowski two graph for K5 and K3,3

8.

9. Use minimal spanning tree for Kruskal Algorithm ,

10. Using Kruskal Prim algorithm for

11.

12. Find minimal spanning tree of

13.

14.
 15.

16.

17.

NOTE: (i). For scoring (50-59) study S.No.(1-10) in part-A and S.No. (1-12) in part-B.
(ii). For scoring (60-79) study S.No.(1-24) in part-A and S.No. (1-24) in part-B.
(iii). For scoring 80 & above study S.No.(1-32) in part-A and S.No. (1-31) in part-B.

**************ALL THE BEST(CSE ) STUDENTS ****************

FACULTY SIGN HOD PRINCIPAL