All Exams Test series for 1 year @ ₹349 only
Question

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 plane is equal to_________.

The correct answer is
6

Understanding Planar Graphs and Faces

The question asks for the number of bounded faces in a specific planar graph G. We are given the number of vertices (\(V\)), the number of edges (\(E\)), and that the graph is connected.

Key Information Provided:

  • Graph Type: Simple, undirected, planar, connected.
  • Number of Vertices (\(V\)): 10
  • Number of Edges (\(E\)): 15

Applying Euler's Formula for Planar Graphs

For any connected planar graph, Euler's formula establishes a relationship between the number of vertices (\(V\)), edges (\(E\)), and faces (\(F\)) in a planar embedding. The formula is:

$ V - E + F = 2 $

Here, \(F\) represents the total number of faces, including the single unbounded face (the region outside the graph).

Calculating the Total Number of Faces (F):

We can plug the given values of \(V\) and \(E\) into Euler's formula:

$ 10 - 15 + F = 2 $

Simplifying the equation:

$ -5 + F = 2 $

Solving for \(F\):

$ F = 2 + 5 $ $ F = 7 $

Therefore, the total number of faces in any planar embedding of graph G is 7.

Calculating Bounded Faces

The total number of faces (\(F\)) is the sum of the number of bounded faces (\(F_{bounded}\)) and the one unbounded face (\(F_{unbounded}\)).

$ F = F_{bounded} + F_{unbounded} $

Since \(F_{unbounded} = 1\), we have:

$ F_{bounded} = F - 1 $

Substituting the calculated value of \(F\):

$ F_{bounded} = 7 - 1 $ $ F_{bounded} = 6 $

Conclusion

Using Euler's formula, we determined that a connected planar graph with 10 vertices and 15 edges has a total of 7 faces. By subtracting the single unbounded face, we find that the number of bounded faces is 6.

Was this answer helpful?

Important Questions from Graph Theory

  1. A principal node is a

  2. Which of the following statement(s) is/are correct regarding about the undirected graph?

    I. Number of odd degree vertices is even.

    II. Sum of degrees of all vertices is even.

  3. Let $G(V, E)$ be an undirected and unweighted graph with 100 vertices. Let $d(u, v)$ denote the number of edges in a shortest path between vertices $u$ and $v$ in $V$. Let the maximum value of $d(u, v)$, $u, v \in V$ such that $u \neq v$, be 30. Let T be any breadth-first-search tree of G. Which ONE of the given options is CORRECT for every such graph G?

  4. Let $G$ be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant $\alpha$ is added to the weight of every edge.
    Which ONE of the following statements is TRUE about the minimum spanning trees (MSTs) and shortest paths (SPs) in $G$ before and after the edge weight update?
  5. Maintaining a graph in memory by means of its adjacency matrix is known as
Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App