Graph Theory MCQ’S

Question 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?
A 1/8
B 1
C 7
D 8

Question 2
Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
A P only
B Q only
C Both P and Q
D Neither P nor Q
Question 3
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?
(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.
A P only
B P and R only
C R only
D P, Q and S only
Question 4
A collection of graph is:
 A. row and coloumn
 B. Equation
 C. vertices and columns
 D.  None of above
Question 5
The number of edges in a complete graph with ‘n’ vertices is equal to:
 A. 2n-1
 B. n(n-1)
 C. n^2
 D. n(n-1)/2
Question 6
In an undirected graph the number of nodes with odd degree must be:
 A. odd
 B. prime
 C. even
 D. zero

Question 7

An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are

A all of even degree

B all of odd degree

C of any degree

D even in number

Question 8
In a graph if e=(u, v) means

A u is adjacent to v but v is not adjacent to u

B e begins at u and ends at v

C u is processor and v is successor

D both b and c
Question 9

In a graph if e=[u, v], Then u and v are called

A. Endpoints of e

B. Adjacent nodes

C. Neighbors

D. All of above

Question 10

A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

A. greater than n–1

B. less than n(n–1)

C. greater than n(n–1)/2

D. less than n2/2

http://cs-mcqs.blogspot.com/2013/05/discrete-mathematics-solved-mcqs.html

Question 11

A vertex of a graph is called even or odd depending upon

A.Total number of edges in a graph is even or odd.
B.Total number of vertices in a graph is even or odd
C.Its degree is even or odd
D.None

Question 12
In any undirected graph the sum of degrees of all the nodes

A.Must be even
B.Are twice the number of edges
C.Must be odd
D.Need not be even

Question 13

A graph with one vertex and no edges

is
A.multigraph
B.digraph
C.isolated graph
D.trivial graph

Question 14

Length of the walk of a graph is

A.The number of vertices in walk W

B.The number of edges in walk W

C.Total number of edges in a graph

D.Total number of vertices in a graph

Question 15

A graph with no edges is known as empty graph. Empty graph is also known as

A.Trivial graph

B.Regular graph

C.Bipartite graph

D.None of these

Question 16

Choose the most appropriate definition of plane graph

A.A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices

B.A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non -
empty disjoint subset X and Y in such a way that each edge of G has one end in X and one end in Y

C.A simple graph which is Isomorphic to Hamiltonian graph

D.None of these

Question 17
The maximum degree of any vertex in a simple graph with n vertices is

A.n–1

B.n+1

C.2n–1

D.n

Question 18

The complete graph with four vertices has k edges where k is

A. 3

B. 4

C. 5

D. 6

Question 19

Suppose v is an isolated vertex in a graph, then the degree of v is

A. 0

B. 1

C. 2

D. 3

Question 20

The number of simple digraphs with |V | = 3 is

(a) 29 (b) 28 (c) 27 (d) 26 (e) 25
Question 21

The number of simple digraphs with |V | = 3 and exactly 3 edges is

(a) 92 (b) 88 (c) 80 (d) 84 (e) 76

Question 22

The number of oriented simple graphs with |V | = 3 is

(a) 27 (b) 24 (c) 21 (d) 18 (e) 15

Question 23
The number of oriented simple graphs with |V | = 4 and 2 edges is
(a) 40 (b) 50 (c) 60 (d) 70 (e) 80

Question 24

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
connected components in G is:

A.n

B.n+2

C.2n/2

D.2n / n

Question 25

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

A.6

B.8

C.9

D.13

Question 26

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 independent set of G is

A.12

B.8

C.Less than 8

D.More than 12

Question 27
Which one of the following graphs is NOT planar? GATECS2005Q47

A.G1

B.G2

C.G3

D.G4

Question 28

Let s and t be two vertices in a 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
congestions 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?

A.a path from s to t in the minimum weighted spanning tree

B.a weighted shortest path from s to t

C.an Euler walk from s to t

D.a Hamiltonian path from s to t

Question 29

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

A.2
B.3

C.4

D.5

Question 30

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

A.k and n

B.k - 1 and k + 1

C.k - 1 and n - 1

D.k + 1 and n - k

Question 31
How many perfect matchings are there in a complete graph of 6 vertices ?
A.15
B.24
C.30
D.60
Question 32
A graph G = (V, E) satisfies |E| ≤ 3 |V| - 6. The min-degree of G is defined as
GATECS2003Q40. Therefore, min-degree of G cannot be
A.3
B.4
C.5
D.6
Question 33
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
A.2
B.3
C.4
D.n - 2⌊n/2⌋ + 2

Question 34
Maximum number of edges in a n - node undirected graph without self loops is
A.n2
B.n(n - 1)/2
C.n - 1
D.(n + 1) (n)/2
Question 35
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 _______________.
A.24
B.20
C.32
D.64
Question 36
A graph is self-complementary if it is isomorphic to its complement. For all self-
complementary graphs on n vertices, n is
A.A multiple of 4
B.Even
C.Odd
D.Congruent to 0 mod 4, or 1 mod 4
Question 37
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of
the following statements is True?
A.A tree has no bridge
B.A bridge cannot be part of a simple cycle
C.Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph)
D.A graph with bridges cannot have a cycle
Question 38
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?
A.10
B.11
C.18
D.19
Question 39
The minimum number of colours that is sufficient to vertex-colour any planar graph is
_______________ [This Question was originally a Fill-in-the-blanks Question]
A.1
B.2
C.3
D.4
Question 40
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
A.Hamiltonian cycle
B.grid
C.hypercube
D.tree
Question 41
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?
A.weight (u, v) < 12
B.weight (u, v) ≤ 12
C.weight (u, v) > 12
D.weight (u, v) ≥ 12
Question 42
What is the chromatic number of the following graph? 2008_3

A.2
B.3
C.4
D.5
Question 43
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
A.regular
B.Complete
C.Hamiltonian
D.Euler
Question 44
The number of articulation point of the following graph is: q4

A.0
B.1
C.2
D.3
Question 45
Consider the following statements
(I) Let T be a binary search tree with 4 height. The minimum and maximum possible nodes
of T are 5 and 15 respectively.
(II) In a binary tree, the number of internal nodes of degree 2 is 6, and the number of
internal nodes of degree 1 is 8. The number of leaf nodes in the binary tree is 15.
Which of the following statement(s) is/are correct?
A.Only (I)
B.Only (II)
C.Both (I) and (II)
D.Neither (I) nor (II)
Question 46
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 following option is not correct about "Line Graph"?
A.A line graph has an articulation point if and only if the underlying graph has a bridge for
which neither endpoint has degree one
B.For a graph G with n vertices and m edges, the number of vertices of the line graph L(G)
is m, and the number of edges of L(G) is half the sum of the squares of the degrees of the
vertices in G, m.
C.If a graph G has an Euler cycle, that is, if G is connected and has an even number of edges at
each vertex, then the line graph of G is Hamiltonian.
D.None of these
Question 47
Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges
in E are positive. Consider the following statements:
The path between a pair of vertices in a minimum spanning tree of an undirected graph is
necessarily the shortest (minimum weight) path.
Minimum Spanning Tree of G is always unique and shortest path between a pair of
vertices may not be unique.
Which of the above statements is/are necessarily true?
A.(1) only
B.(2) only
C.both (1) and (2)
D.neither (1) nor (2)
Question 48
The chromatic number of the following graph is _________ . Note - This was Numerical
Type question.1

A.2
B.4
C.3
D.5
Question 49
Consider the following undirected graph G:

1Choose 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 _________ . Note -This was
Numerical Type question.
A.4
B.5
C.2
D.3
Question 50
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 = _______ . Note -This was Numerical Type question.
A.109
B.110
C.119
D.None of these
Question 51
The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly
once is _______. Note -This was Numerical Type question.
A.80
B.8
C.20
D.210
Question 52

Consider the graph given below : kruskal Use Kruskal’s algorithm to find a minimal
spanning tree for the graph. The List of the edges of the tree in the order in which they are
choosen is? (1) AD, AE, AG, GC, GB, BF (2) GC, GB, BF, GA, AD, AE (3) GC, AD, GB,
GA, BF, AE (4) AD, AG, GC, AE, GB, BF
A.(1)
B.(1),(2)
C.(1),(2),(3)
D.(1),(2),(3),(4)
Question 53
Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge
with maximum weight and Emin the edge with minimum weight. Which of the following
statements is false?
A.Every minimum spanning tree of G must contain Emin.
B.If Emax is in minimum spanning tree, then its removal must disconnect G.
C.No minimum spanning tree contains Emax
D.G has a unique minimum spanning tree.
Question 54
Consider a full binary tree with n internal nodes, internal path length i, and external path
length e. The internal path length of a full binary tree is the sum, taken over all nodes of
the tree, of the depth of each node. Similarly, the external path length is the sum, taken
over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the
full binary tree?
A.e = i+n
B.e = i+2n
C.e = 2i+n
D.e = 2n+i

Question 55
An undirected graph G (V, E) contains n (n > 2) nodes named v1 , v2 ,...,vn. Two nodes vi
and vj are connected if and only if 0 < │ i − j│ ≤2. Each edge (vi , vj ) is assigned a weight
i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:
A.88
B.91
C.49
D.21
Question 56
Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)| = n ≥ 3.
Then which of the following is true ?
A.deg(v) ≥n/2 for each vertex v.
B.|E(G)| ≥1/2(n – 1) (n – 2) + 2
C.deg (v) + deg(w) ≥ n whenever v and w are not connected by an edge
D.All of the above
Question 57
A given connected graph is a Euler Graph if and only if all vertices of are of
A.same degree
B.even degree
C.odd degree
D.different degree
Question 58
The maximum number of edges in a n-node undirected graph without self loops is
A.n2
B.n(n-1)/2
C.n-1
D.n(n+1)/2
Question 59
Given the following graphs: 5

(1) Which of the following is correct?

A.G1 contains Euler circuit and G2 does not contain Euler circuit.
B.G1 does not contain Euler circuit and G2 contains Euler circuit.
C.Both G1 and G2 do not contain Euler circuit.
D.Both G1 and G2 contain Euler circuit.
Question 60
Consider an un-directed 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 or | b – d |
< 1. The number of edges in this graph is:
A.726
B.796
C.506
D.616
Question 61
How many different trees are there with four nodes A, B, C and D ?
A.30
B.60
C.90
D.120

Question 62
The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2
have ______ and _______ respectively.
A.14, 14
B.16, 14
C.16, 4
D.14, 4

Question 63
How many diagonals can be drawn by joining the angular points of an octagon?
A.14
B.20
C.21
D.28
Question 64
The number of edges in a 'n' vertex complete graph is ?
A.n * (n-1) / 2
B.n * (n+1) / 2
C.n2
D.n * (n+1)

Question 65
Which of the following statement(s) is/are false ? (a) A connected multigraph has an Euler
Circuit if and only if each of its vertices has even degree. (b) A connected multigraph has
an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd
degree. (c) A complete graph (Kn) has a Hamilton Circuit whenever n ≥ 3. (d)A cycle over
six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
Codes:
A(a) only
B(b) and (c)
C(c) only
D(d) only
Question 66

Consider the graph given below: 4 (2) The two distinct sets of vertices, which make the
graph bipartite are:
A.(v1, v4, v6); (v2, v3, v5, v7, v8)
B.(v1, v7, v8); (v2, v3, v5, v6)
C.(v1, v4, v6, v7); (v2, v3, v5, v8)
D.(v1, v4, v6, v7, v8); (v2, v3, v5)

Question 67

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2,....n
such that the absolute value of the difference of the labels of adjacent vertices are all
different. Which of the following trees are graceful? 5 (3) codes:
A.(a) and (b)
B.(b) and (c)
C.(a) and (c)
D.(a), (b) and (c)

Question 68
Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the
following is true with respect to this Graph (G) ? (a) deg (v) ≥ n / 2 for each vertex of G (b) |
E(G)| ≥ 1 / 2 (n - 1) (n - 2) + 2 edges (c) deg (v) + deg (w) ≥ n for every n and v not connected
by an edge.
A.(a) and (b)
B.(b) and (c)
C.(a) and (c)
D.(a), (b) and (c)
Question 69

Consider the given graph 21 (3) Its Minimum Cost Spanning Tree is __________. (1) 21 (4)
(2) 21 (5) (3) 21 (6) (4) 21 (7)

4
A.(1)
B.(2)
C.(3)
D.(4)
Question 70
If node A has three siblings and B is parent of A, what is the degree of A?
A.0
B.3
C.4.
D.None of the above

Question 71
How many edges are there in a forest with v vertices and k components?
A.(v + 1) − k
B.(v + 1)/2 − k
C.v − k
D.v + k

Question 72
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 down between
A.k and n
B.k-1 and k+1
C.k-1 and n-1
D.k+1 and n-k

Question 73
A graph in which all nodes are of equal degree, is known as
A.Multigraph
B.Non regular graph
C.Regular graph
D.Complete graph

Question 74
In a graph G there is one and only one path between every pair of vertices then G is a
A.Path
B.Walk
C.Tree
D.Circuit

Question 75
A simple graph ( a graph without parallel edge or loops) with n vertices and k components
can have at most
A.n edges
B.n-k edges
C.(n − k)(n − k + 1) edges
D.(n − k)(n − k + 1)/2 edges

Question 76
If G is a graph with e edges and n vertices, the sum of the degrees of all vertices in G is
A.e
B.e/2
C.e2
D.2 e

Question 77
The number of distinct simple graphs with up to three nodes is
A.15
B.10
C.7
D.9

Question 78
The maximum number of edges in a n-node undirected graph without self loops is
A.n2
B.n * (n-1)/2
C.n - 1
D.(n + 1) * n/2

Question 79
Consider the graph shown in the figure below: Which of the following is a valid strong
component?
A.a, c, d
B.a, b, d
C.b, c, d
D.a, b, c

Question 80
A graph with n vertices and n-1 edges that is not a tree, is
A.Connected
B.Disconnected
C.Euler
D.A circuit