Planar Graph

974 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 ?

recategorized

1 vote

By Euler formula for connected planar graph,

$\color{red}{n - e + f = 2}$

$n = 14$

$e = 20$

$14-20 + f = 2$

$f = 8$

In any planer graph there will be only 1 open region and rest all are closed by edges.

So total closed regions = $8-1 = 7$

selected by
0
Bounded region and closed region are the same thing ?
1

i think so, what's the answer given?

0
Its correct :)

Related questions

1 vote
1
290 views
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
Can minimum degree of a planar graph be $5$? Give some example
A planar graph has, $\large\color{maroon}{\text{k}}$ connected components $\large\color{maroon}{\text{v}}$ vertices $\large\color{maroon}{\text{e}}$ edges If the plane is divided into $\large\color{maroon}{\text{r}}$ ... $\large\color{maroon}{\text{v}}$ , $\large\color{maroon}{\text{e}}$ and $\large\color{maroon}{\text{r}}$ ?
How many planar regions? How many closed regions? and how many are unbounded? How many of then are bounded by a cycle of length $4$ ? Now, for example (a different question, not related to above diagram ) a question says, In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges? Please explain the last QS with the help of Euler's equation.