GATE 2007 CS – Question 4
Let G be a nonplanar graph with the minimum possible number of edges. G has
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
- GATE 2007 CS Q23
- GATE 2026 CS (CS1) Q55
- GATE 2026 CS (CS2) Q36
- GATE 2024 CS (CS1) Q34
- GATE 2024 CS (CS1) Q51
- GATE 2024 CS (CS2) Q17
All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →