Question
Let be a connected planar graph with vertices. If the number of edges on each face is three, then the number of edges in is _____.
Official answer and solution
- Official answer
- 24
- From
- Official GATE 2015 answer key
Solution
Use Euler formula V - E + F = 2 and the face-edge degree sum relation for planar graphs.
-
Given:
- Connected planar graph with vertices.
- Every face is bounded by exactly 3 edges: for each face .
-
Handshaking Lemma for Faces:
Each edge is shared by two faces (or bounds two sides of a face), so: -
Euler's Formula:
For any connected planar graph:Substitute and :
The number of edges in is .
24
Forgetting the factor of 2 in 3F = 2E.
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2015 Computer Science and Information Technology (CS) Session 1
- Question
- 64 of 65, printed as CS Q.54
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.