Graph Theory Previous Year GATE Questions

Let G be an undirected complete graph on n vertices, where

n > 2. Then, the number of different Hamiltonian cycles in G
is equal to (GATE 2019)
(A) n!
(B) n – 1!
(C) 1
(D) (n-1)! / 2

Let G be a graph with 100! vertices, with each vertex labelled 

by a distinct permutation of the numbers 1, 2, …, 100. There 
is an edge between vertices u and v if and only if the label of 
u can be obtained by swapping two adjacent numbers in the 
label of v. Let y denote the degree of a vertex in G, and z 
denote the number of connected components in G. Then y + 
10z = _______ (GATE 2018) 

 
  

 
The chromatic number of the following graph is _________ 
.(GATE 2018) 

 
  

 
Consider the following undirected graph G:

 
Choose a value for x that will maximize the number of minimum
weight spanning trees (MWSTs) of G. The number of MWSTs of G
for this value of x is _________ .(GATE 2018)
 G is an undirected graph with n vertices and 25 edges such
that each vertex has degree at least 3. Then the maximum
possible value of n is ________(GATE 2017 -SET-2)
(A) 4
(B) 8
(C) 16
(D) 24

Let T be a tree with 10 vertices. The sum of the degrees of

all the vertices in T is _____. (GATE 2017 Set-1)

The minimum number of colours that is sufficient to

vertex-colour any planar graph is __________(GATE 2016
Set-2)
 A graph is self-complementary if it is isomorphic to its 
complement. For all self-complementary graphs on n 
vertices, n is (GATE 2015 Set-2) 
A multiple of 4
Even
Odd
Congruent to 0 mod 4, or 1 mod 4

Let G be a connected planar graph with 10 vertices. If the 

number of edges on each face is three, then the number of 
edges in G is _______________.(GATE 2015 Set-1) 
24 
20 
32 
64 
   
  
In a connected graph, a bridge is an edge whose removal
disconnects a graph. Which one of the following statements
is True?(GATE 2015 Set-2)
A tree has no bridge
A bridge cannot be part of a simple cycle
Every edge of a clique with size ≥ 3 is a bridge (A
clique is any complete subgraph of a graph)
A graph with bridges cannot have a cycle

Consider an undirected graph G where self-loops are not 

allowed. The vertex set of G is {(i, j): 1 <= i <= 12, 1 <= j <= 12}. 
There is an edge between (a, b) and (c, d) if |a − c| <= 1 and |b 
− d| <= 1. The number of edges in this graph is 
__________(GATE 2014 Set-1) 
500 
502 
506 
510 
  
An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is 
called graphic if there exists a simple undirected graph with 
n vertices having degrees d1, d2, … , dn respectively. Which 
of the following 6-tuples is NOT graphic?(GATE 2014 Set-1) 
(1, 1, 1, 1, 1, 1)
(2, 2, 2, 2, 2, 2)
(3, 3, 3, 1, 0, 0)
(3, 2, 1, 1, 1, 0)

Let G=(V,E) be a directed graph where V is the set of

vertices and E the set of edges. Then which one of the
following graphs has the same strongly connected
components as G ?(GATE 2014 Set-1)
G1 = (V,E1) where E1={(u,v)∣(u,v)∉E}
G2 = (V,E2) where E2={(u,v)∣(v,u)∈E}
G3 = (V,E3) where E3={(u,v)∣ there is a path of length
≤2 from u to v in E}
 G4 = (V4,E) where V4 is the set of vertices in G which
are not isolated

​ he maximum number of edges in a bipartite graph on 12 

T
vertices is ________(GATE 2014 Set-2) 
36
48
12
24
A cycle on n vertices is isomorphic to its complement. The
value of n is _____.(GATE 2014 Set-2)
2
4
6
5

If G is a forest with n vertices and k connected components, 

how many edges does G have? (GATE 2014 set-3) 
floor(n/k)
ceil(n/k)
n-k
n-k+1
Let d denote the minimum degree of a vertex in a graph. For 
all planar graphs on n vertices with d ≥ 3, which one of the 
following is TRUE?(GATE 2014 Set-3) 
In any planar embedding, the number of faces is at
least n/2 + 2
In any planar embedding, the number of faces is less
than n/2 + 2
There is a planar embedding in which the number of
faces is less than n/2 + 2
There is a planar embedding in which the number of
faces is at most n/(d+1)

Consider an undirected random graph of eight vertices. The

probability that there is an edge between a pair of vertices is
1/2. What is the expected number of unordered cycles of
length three?(GATE CS 2013)
⅛
1
7
8
 Which of the following statements is/are TRUE for undirected
graphs?(GATE CS 2013)
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
P only
Q only
Both P and Q
Neither P nor Q

The line graph L(G) of a simple graph G is defined as

follows: · There is exactly one vertex v(e) in L(G) for each
edge e in G. · For any two edges e and e' in G, L(G) has an
edge between v(e) and v(e'), if and only if e and e'are
incident with the same vertex in G. Which of the following
statements is/are TRUE? (GATE CS 2013)
(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.
P only
P and R only
 R only
P,Q and S only

Let G be a simple undirected planar graph on 10 vertices

with 15 edges. If G is a connected graph, then the number of
bounded faces in any embedding of G on the plane is equal
to (GATE 2012)
3
4
 5
6

​Which of the following graphs is isomorphic to (GATE 2012) 

 
A
B
C
D
 Let G be a complete undirected graph on 6 vertices. If 
vertices of G are labeled, then the number of distinct cycles 
of length 4 in G is equal to (GATE 2012) 
15 
30 
45 
360 

 
  

(GATE 2011)
K4 is planar while Q3 is not
Both K4 and Q3 are planar
Q3 is planar while K4 is not
Neither K4 nor Q3 are planar

Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id

is the number of vertices of degree d in G. If S and T are two
different trees with ξ(S) = ξ(T),then (GATE 2010)
|S| = 2|T|
|S| = |T|-1
|S| = |T|
|S| = |T|+1
 The degree sequence of a simple graph is the sequence of
the degrees of the nodes in the graph in decreasing order.
Which of the following sequences can not be the degree
sequence of any graph?(GATE 2010)
(I) 7, 6, 5, 4, 4, 3, 2, 1
(II) 6, 6, 6, 6, 3, 3, 2, 2
(III) 7, 6, 6, 4, 4, 3, 2, 2
(IV) 8, 7, 7, 6, 4, 2, 1, 1
I and II
III and IV
IV only
II and IV
 What is the chromatic number of an n-vertex simple
connected graph which does not contain any odd length
cycle? Assume n >= 2.(GATE 2009)
2
3
n-1
N

Which one of the following is TRUE for any simple connected 

undirected graph with more than 2 vertices? (GATE 2009) 
No two vertices have the same degree
At least two vertices have the same degree
At least three vertices have the same degree
All vertices have the same degree

​ hich of the following statements is true for every planar 

W
graph on n vertices? (GATE 2008) 
 The graph is connected
The graph is Eulerian
The graph has a vertex-cover of size at most 3n/4
The graph has an independent set of size at least n/3

G is a graph on n vertices and 2n - 2 edges. The edges of G 

can be partitioned into two edge-disjoint spanning trees. 
Which of the following is NOT true for G?(GATE 2008) 
For every subset of k vertices, the induced subgraph
has at most 2k-2 edges
The minimum cut in G has at least two edges
There are two edge-disjoint paths between every pair
to vertices
There are two vertex-disjoint paths between every pair
of vertices
​What is the chromatic number of the following graph? 

(GATE IT-2008)  
2 
3 
4 
5 

 
G is a simple undirected graph. Some vertices of G are of 
odd degree. Add a node v to G and make it adjacent to each 
odd degree vertex of G. The resultant graph is sure to 
be(GATE IT 2008) 
Regular 
Complete 
Hamiltonian 
Euler 
    
Let G be the non-planar graph with the minimum possible
number of edges. Then G has (GATE 2007)
9 edges and 5 vertices
9 edges and 6 vertices
10 edges and 5 vertices
10 edges and 6 vertices

Consider a weighted undirected graph with positive edge 

weights and let uv be an edge in the graph. It is known that 
the shortest path from the source vertex s to u has weight 53 
and the shortest path from s to v has weight 65. Which one 
of the following statements is always true?(GATE IT 2007) 
weight (u, v) < 12
weight (u, v) ≤ 12
weight (u, v) ≤ 12
weight (u, v) ≥ 12
Which of the following graphs has an Eulerian circuit?(GATE 
2007) 
Any k-regular graph where k is an even number.
A complete graph on 90 vertices
The complement of a cycle on 25 vertices
None of the above

The 2n vertices of a graph G corresponds to all subsets of a

set of size n, for n >= 6 . Two vertices of G are adjacent if
and only if the corresponding sets intersect in exactly two
elements. The number of vertices of degree zero in G
is:(GATE 2006)
 1
n
n+1
n
2​

n​
The 2​ vertices of a graph G corresponds to all subsets of a
set of size n, for n >= 6. Two vertices of G are adjacent if and
only if the corresponding sets intersect in exactly two
elements. The number of connected components in G
is:(GATE 2006)
n
n+2
n/2
2​
n​
2​ /n

If all the edge weights of an undirected graph are positive,

then any subset of edges that connects all the vertices and
has minimum total weight is a (GATE IT 2006)
Hamiltonian cycle
Grid
Hypercube
Tree
Let G be a simple connected planar graph with 13 vertices 
and 19 edges. Then, the number of faces in the planar 
embedding of the graph is (GATE 2005) 
6 
8 
9 
13 

 
Let G be a simple graph with 20 vertices and 100 edges. The 
size of the minimum vertex cover of G is 8. Then, the size of 
the maximum indepen​dent set of G is(GATE 2005) 
12 
8 
Less than 8 
More than 12 

 
Which one of the following graphs is NOT planar (GATE 
2005) 
  
G1 
G2 
G3 
G4 

 
Let s and t be two vertices in an undirected graph G + (V, E)
having distinct positive edge weights. Let [X, Y] be a partition
of V such that s ∈ X and t ∈ Y. Consider the edge e having
the minimum weight amongst all those edges that have one
vertex in X and one vertex in Y. Let the weight of an edge e
denote the congestion on that edge. The congestion on a
path is defined to be the maximum of the congestion on the
edges of the path. We wish to find the path from s to t having
minimum congestion. Which one of the following paths is
always such a path of minimum congestion?(GATE 2005)
a path from s to t in the minimum weighted spanning
tree
a weighted shortest path from s to t
an Euler walk from s to t
a Hamiltonian path from s to t

What is the number of vertices in an undirected connected 

graph with 27 edges, 6 vertices of degree 2, 3 vertices of 
degree 4
​ ​ and remaining of degree 3?(GATE IT 2004). 
 10 
11 
18 
19 

 
The minimum number of colours required to colour the
following graph, such that no two adjacent vertices are
assigned the same colour, is (GATE 2004)

2
3
4
5
Let G be an arbitrary graph with n nodes and k components.
If a vertex is removed from G, the number of components in
the resultant graph must necessarily lie between(GATE
2003)
k and n
k - 1 and k + 1
k - 1 and n - 1
k + 1 and n - k

How many perfect matchings are there in a complete graph 

of 6 vertices ?(GATE 2003) 
15 
24 
30 
60 

 
A graph G = (V, E) satisfies |E| ≤ 3 |V| - 6. The min-degree
of G is defined as . Therefore, min-degree of
G cannot be (GATE 2003)
3 
4 
5 
6 
  
The minimum number of colours required to colour the 
vertices of a cycle with η nodes in such a way that no two 
adjacent nodes have the same colour is(GATE 2002) 
2 
3 
4 
n - 2⌊n/2⌋ + 2

Maximum number of edges in a n - node undirected graph 

without self loops is (GATE 2002) 
2 
n​
n(n-1)/2 
n-1 
(n+1)(n)/2 

   
How many undirected graphs (not necessarily connected)
can be constructed out of a given set V = {v1, v2, … vn} of n
vertices?(GATE 2001)
(A) n(n-1)/2
(B) 2n
(C) n!
n(n-1)/2
(D) 2​

The number of articulation points of the following graph

is(GATE 1999)

0
1
2
3

Let G be the graph with 100 vertices numbered 1 to 100.

Two vertices i and j are adjacent if |i−j|=8 or |i−j|=12. The
number of connected components in G is (GATE 1997)
8
4
12
25
The minimum number of edges in a connected cyclic graph
on n vertices is:(GATE 1995)
n−1
n
n+1
None of the above

The number of distinct simple graphs with up to three nodes

is (GATE 1994)
15
10
7
9
 The number of edges in a regular graph of degree d and n
vertices is _____(GATE 1994)

A non-planar graph with minimum number of vertices has

(GATE 1992)
(a) 9 edges, 6 vertices
(b) 6 edges, 4 vertices
(c) 10 edges, 5 vertices
(d) 9 edges, 5 vertices

Maximum number of edges in a planar graph with n vertices

is _______(GATE 1992)

The maximum number of possible edges in an undirected

graph with n vertices and k components is ______(GATE
1991)
 Choose the correct alternatives (More than one may be
correct).(GATE 1990)
A graph is planar if and only if,
It does not contain subgraphs homeomorphic to k​5​ and

k​3,3​.

It does not contain subgraphs isomorphic to k​5​ or k​3,3​.

It does not contain a subgraph isomorphic to k​5​ or k​3,3

It does not contain a subgraph homeomorphic to k​5​ or

k​3,3​.

Which of the following graphs is/are planar? (GATE 1989)