Question

Let GG be a connected planar graph with 1010 vertices. If the number of edges on each face is three, then the number of edges in GG 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.

  1. Given:

    • Connected planar graph GG with V=10V = 10 vertices.
    • Every face is bounded by exactly 3 edges: deg(f)=3\text{deg}(f) = 3 for each face ff.
  2. Handshaking Lemma for Faces:
    Each edge is shared by two faces (or bounds two sides of a face), so:

    ∑f∈Fdeg(f)=2E  ⟹  3F=2E  ⟹  F=2E3.\sum_{f \in F} \text{deg}(f) = 2E \implies 3F = 2E \implies F = \frac{2E}{3}.
  3. Euler's Formula:
    For any connected planar graph:

    V−E+F=2.V - E + F = 2.

    Substitute V=10V = 10 and F=2E3F = \frac{2E}{3}:

    10−E+2E3=210 - E + \frac{2E}{3} = 2
    10−E3=210 - \frac{E}{3} = 2
    E3=8  ⟹  E=24.\frac{E}{3} = 8 \implies E = 24.

The number of edges in GG is 2424.

Final answer

24

Common trap

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.