581 views
0 votes
0 votes
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are :

a)24

b)37

c)7

d)10

Answer given : 7

How to solve this ? Is there any formulae for number of regions calculation?

The only one I know is r=e-n+2 for any planar graph.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Pavan Kumar Munnam asked May 12, 2017
374 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
3 votes
3 votes
3 answers
2
Vicky rix asked Apr 7, 2017
1,405 views
A graph consists of only one vertex,which is isolated ..Is that graphA) a complete graph ???B) a clique???C) connected graph ???Please explain your answer ...
0 votes
0 votes
1 answer
3
1 votes
1 votes
4 answers
4
Vicky rix asked Mar 11, 2017
3,409 views
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?