Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is …
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2015 Set 1 · Q54
Time
Your answerNumerical answer
Solution
Official answer: 24
Graph TheoryLet:
be the number of vertices
be the number of edges
be the number of faces
Since each face is bounded by exactly edges and every edge is shared by faces (or counted twice across face boundaries):
Using Euler's formula for a connected planar graph:
Substitute and :
Thus, the number of edges in is 24.
Try the question first, then check your work.
Examiner trap
Use Euler's formula along with the face-edge handshaking relation .
This Graph Theory previous year question is Q54 of the GATE CSE 2015 Set 1 paper. Find more GATE CSE PYQs on Graph Theory in Engineering Mathematics, or browse all GATE CSE PYQs.
Free diagnostic
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Graph Theory PYQs now with no account.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
Graph Theory has 21 GATE CSE PYQs across 14 papers from 2012 to 2026. 7 of them are 2-mark NAT questions like this one, and it is the only one in GATE CSE 2015 Set 1.
How GATE tests Graph TheoryIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.