ENGINEERING MATHEMATICS

GRAPH THEORY

1. Which of the following graphs is not planar?

2. 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) 0 (b) 8
(c) 9 (d) 13

3. Degree of each vertex in Kn is

(a) n (b) n – 1
(c) n – 2 (d) 2n – 1

4. If G and G* are isomorphic graphs, then number of connected components of G* if G has 8

connected components, are

(a) 4 (b) 6
(c) 8 (d) 10

1
 Common Data Questions: Q.5 & Q.6

5. The degree of vertex P3

(a) 1 (b) 2
(c) 3 (d) none of these

6. Degree of vertex P5

(a) 1 (b) 2
(c) 3 (d) 4

7. If v is an isolated vertex in a graph (multigraph) G then what is its degree?

(a) 0 (b) 1
(c) 2 (d) 3

8. 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 lie between

(a) k and n (b) k – 1 and k + 1

(c) k – 1 and n – 1 (d) k + 1 and n – k

9. A cycle of n vertices is isomorphic to its complement. The value of n is ________.

10. The maximum number of edges in a bipartite graph on 12 vertices is ________.

2
11. The number of distinct minimum spanning tree for the weighted graph below is _________.

12. Which of the following statements is/are TRUE for undirected graphs?

P: Number of odd degree vertices is even

Q: Sum of degree of all vertices is even

(a) P only (b) Q only

(c) Both P and Q (d) Neither P and Q

13. Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then number
of distinct cycles of length 4 in G is equal to

(a) 15 (b) 30
(c) 90 (d) 360

14. 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 4 on the plane is

(a) 3 (b) 4
(c) 5 (d) 6

15. Define ∑(𝐺) = ∑𝑑 𝑖𝑑 × 𝑑 , where id is the number of vertices of degree d in G. If S and T are
two different trees with Σ(S) = Σ(T), then

(a) |S| = 2|T| (b) |S| = |T| – 1

(c) |S| = |T| (d) |S| = |T| + 1