Multiple choice

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

  1. 9 edges and 5 vertices

  2. 9 edges and 6 vertices

  3. 10 edges and 5 vertices

  4. 10 edges and 6 vertices
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Kurtowskis 3,3 (K3,3) is a non - planer graph with minimum number of edges. It has 9 edges and 6 vertices.

Keep practicing — related questions