search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
0 votes
220 views
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.
in Graph Theory 220 views
4
Euler's formula for planar graph:

V - E + R = 1 + K

where, K-> No. of components

Solve using this, R=7
0
Thanks

Please log in or register to answer this question.

Related questions

1 vote
2 answers
1
0 votes
0 answers
2
162 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
asked May 12, 2017 in Graph Theory Pavan Kumar Munnam 162 views
3 votes
3 answers
3
513 views
A graph consists of only one vertex,which is isolated ..Is that graph A) a complete graph ??? B) a clique??? C) connected graph ??? Please explain your answer ...
asked Apr 7, 2017 in Graph Theory Vicky rix 513 views
...