Data Structures

1:

Let G be a non-planar graph with the minimum possible number of edges. Then G has

A.

9 edges and 5 vertices

B.

9 edges and 6 vertices

C.

10 edges and 5 vertices

D.

10 edges and 6 vertices

 

Answer : B

Explanation :

Any non-planar graph has K5 or K3,3 as a subgraph. Both these subgraphs are non-planar. K5 has 5 vertices and 10 edges. K3,3 has 6 vertices and 9 edges. Since we are interested in the non-planar with the fewest number of edges, option (B) is the correct choice.

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.