The GATE Grind

GATE 2007 CS – Question 4

Engineering Mathematics · Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) · 1 mark · Multiple choice

Let G be a nonplanar graph with the minimum possible number of edges. G has

  1. 9 edges, 5 vertices
  2. 9 edges, 6 vertices
  3. 10 edges, 5 vertices
  4. 10 edges, 6 vertices

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) 9 edges, 6 vertices

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions

All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →