wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

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
  1. 24

Open in App
Solution

The correct option is A 24
Number of vertices (n) = 10
d(r1)=3

Number of edges (e) = ?
r = e - v + 2

(euler's formula for connected planar graphs)
r = e - 10 + 2 = e - 8 ...(1)

Since every region is bounded by exactly 3 edges and since every edge is exactly double counted, we have the equation

e=3r2r=2e3

Substituting this in equation (1) we get,
2e3=e8

2e=3e24e=24

flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Solids and Their Classification
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon