retagged by
9,090 views

2 Answers

Best answer
8 votes
8 votes

If f is any face, then the degree of f (denoted by deg f) is the number of edges encountered in a walk around the boundary of the face f

No. edges = no. of region*(deg/2) (since each edge is part of exactly 2 regions in a planar graph and hence contributes 2 to the sum of degrees)


We have Euler's formula for planar graph

$n - e + f = 2$, where $n$ is the no. of vertices, $e$ is the no. of edges and $f$ is the no. of faces (regions in planar representation)

And we have $2e = 6f = 6 \times 35 = 210 \\ \implies e = 105$.

Now, $n = 2 + 105 - 35 = 72$.
 

selected by

Related questions

0 votes
0 votes
1 answer
1
Dhiraj_777 asked May 4, 2023
488 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
1 votes
1 votes
0 answers
2
Shamim Ahmed asked Dec 21, 2018
792 views
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
0 votes
0 votes
1 answer
3
Na462 asked Dec 2, 2018
3,508 views
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
0 votes
0 votes
1 answer
4
srestha asked Oct 22, 2018
1,625 views
Can minimum degree of a planar graph be $5$? Give some example