Register

GATE CSE 2015 Set 1 | Question: 54

• retagged by
24,827 views
33 votes
33 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
User Avatar

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.
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

13 votes
13 votes
5 answers
9
Arjun asked Feb 18, 2021
8,290 views
GATE CSE 2021 Set 1 | Question: 16
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
User Avatar
103 votes
103 votes
10 answers
10
go_editor asked Sep 28, 2014
27,087 views
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $...
User Avatar
39 votes
39 votes
9 answers
12
go_editor asked Sep 28, 2014
27,322 views
GATE CSE 2014 Set 2 | Question: 3
The maximum number of edges in a bipartite graph on $12$ vertices is____
The maximum number of edges in a bipartite graph on $12$ vertices is____
User Avatar
Link Copied!