Professional Documents
Culture Documents
19.previous Year GATE Questions (No Answers)
19.previous Year GATE Questions (No Answers)
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
The maximum number of edges in a bipartite graph on 12
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
A
B
C
D
(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
(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
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
k3,3.
k3,3.
Which of the following graphs is/are planar? (GATE 1989)