how to find the number of bounded faces in an undirected graph

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

GRAPH-THEORY-AND-COMBINATORICS10CS42-->View question

## how to find the number of bounded faces in an undirected graph?

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to.....?

By:tarun101

Taged users:
|metaphor|Akhil-Raj

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

## You may also like our videos

This can be computed according to Euler's formula

Aparna-Dasgupta

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
------------------------------------

### Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.