Scribd
Upload
30 views4 pages

Em - S14 (Graph Theory)

em--S14(Graph Theory)

Uploaded by

anshulrajput338
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views4 pages

Em - S14 (Graph Theory)

em--S14(Graph Theory)

Uploaded by

anshulrajput338
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ENGINEERING MATHEMATICS

GRAPH THEORY

SOLUTIONS

1. Which of the following graphs is not planar?

Solution: Option (a)

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

Solution: Option (b)

3. Degree of each vertex in Kn is

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

Solution: Option (b)

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

Solution: Option (c)

Common Data Questions: Q.5 & Q.6

5. The degree of vertex P3

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

Solution: Option (b)

6. Degree of vertex P5

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

Solution: Option (c)

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

Solution: Option (a)

2
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

Solution: Option (c)

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

Solution: 5

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

Solution: 36

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

Solution: 6

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

Solution: Option (c)

3
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

Solution: Option (c)

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

Solution: Option (d)

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

Solution: Option (c)

You might also like