retagged by
24,385 views
32 votes
32 votes
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_______________.
retagged by

9 Answers

0 votes
0 votes
A connected planar graph with 10 vertices and 3 edges on each face is known as a triangulation. In general, a triangulation of a planar graph with n vertices will have 3n - 6 edges. Therefore, a triangulation of a planar graph with 10 vertices will have 3 * 10 - 6 = 24 edges.
Answer:

Related questions

13 votes
13 votes
5 answers
1
Arjun asked Feb 18, 2021
8,022 views
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
100 votes
100 votes
10 answers
2
38 votes
38 votes
9 answers
4
go_editor asked Sep 28, 2014
26,911 views
The maximum number of edges in a bipartite graph on $12$ vertices is____