Question

10: If a connected planar graph G has n
vertices, e edges and r regions, then​

Answer 1

Answer:

Theorem: [Euler's Formula] For a connected planar simple graph G=(V,E) with e=|E| and v=|V|, if we let r be the number of regions that are created when drawing a planar representation of the graph, then r=e-v+2. ... So we can build any planar graph with e edges and it will always have r=e-v+2.

Step-by-step explanation:

Hope it helps you