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 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.
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).
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.
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 $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.
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?
Consider the following statements regarding graph theory :
1. Chord is that branch of the graph that does not belong to the particular tree.
2. Cut-set is a unique set with respect to a given tree of a connected graph containing one chord and all of the free branches contained in the free path formed between two vertices of the chord.
3. If M represents the number of branches and N the number of nodes, the minimum number of variables involved in analyzing a network is equal to $(M + N − 1)$.
Which of the above statements are not correct?
The incidence matrix of the graph shown
