retagged by
8,148 views

5 Answers

0 votes
0 votes

Here, |V| = 8 and |R| = 5

From Euler equation, for any connected planar graph (Need not to be simple)

|V| + |R| = |E| + 2   always hold true.

 

where,  |V| = Number of vertices     |R| = Number of faces or Regions    |E| = Number of Edges

hence, 8 + 5 = |E| + 2

            |E| = 11

 

Answer:

Related questions

10 votes
10 votes
3 answers
5
Arjun asked Feb 18, 2021
8,355 views
Consider the following sequence of operations on an empty stack.$$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\texts...
33 votes
33 votes
9 answers
6
makhdoom ghaya asked Feb 13, 2015
24,600 views
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_______________.
10 votes
10 votes
1 answer
7
Kathleen asked Sep 12, 2014
5,517 views
Maximum number of edges in a planar graph with $n$ vertices is _____