1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard VII
Mathematics
Polyhedrons
Let G be a co...
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
24
Open in App
Solution
The correct option is
A
24
Number of vertices (n) = 10
d
(
r
1
)
=
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
=
3
r
2
⇒
r
=
2
e
3
Substituting this in equation (1) we get,
2
e
3
=
e
−
8
2
e
=
3
e
−
24
⇒
e
=
24
Suggest Corrections
1
Similar questions
Q.
Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is
Q.
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
Q.
In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is
Q.
Let G be the non-planar graph with the minimum possible number of edges. Then G has
Q.
The minimum number of edges in a connected graph with in vertices is
View More
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Related Videos
Solids and Their Classification
MATHEMATICS
Watch in App
Explore more
Polyhedrons
Standard VII Mathematics
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
AI Tutor
Textbooks
Question Papers
Install app