Let G be the 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: According to Kuratowski\’s Theorem, a graph is planar if and only if it does not contain any subdivisions of the graphs K₅ or K_3,3.

That means K₅ and K_3,3 are minimum non-planar graphs. These graphs have 5 vertices with 10 edges in K₅ and 6 vertices with 9 edges in K_3,3 graph.
So, graph K₅ has minimum vertices and maximum edges than K_3,3.

So, option (B) is correct.

Quiz of this Question