Let G = (V, E) be a directed graph where $V_{1}$ the set of vertices and E the set of edges. The which one of the following graphs has the same strongly connected components as G?

G_{1} = (V, E_{1}) where E_{1} = {(u, v) | (u, v) / ϵ E}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

G_{2} = (V, E_{2}) where E_{2} = {(u, v) | (u, v) ϵ E}

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

G_{3} 6 = (V, E_{3}) ~ w h e r e E_{3} = {(u, v) | there is a part of length \leq 2 from u to v in E}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

G_{4} = (V_{4}, E) V_{4}

is the set of vertices in G which are not isolated

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B $G_{2} = (V, E_{2}) where E_{2} = {(u, v) | (u, v) ϵ E}$
G = (V, E) is directed graph

$G_{2} = (v, E_{2}) where E_{2} = {(u, v) | (v, u) ϵ E}$

G and $G_{2}$ has same strongly connected components only the difference in $G_{2}$ is that all edges of G have been reversed the direction.

Suggest Corrections

Similar questions

Q. 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

Q. Which of the following is the correct decomposition of the directed graph given below into its strongly connected components?

Q. Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is

The $2^{n}$ vertices of graph G correspond to all subsets a set of size n, for $n \geq 6.$ Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements.

The number of connected components in G is

Q. Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is

Join BYJU'S Learning Program

Let G = (V, E) be a directed graph where V1 the set of vertices and E the set of edges. The which one of the following graphs has the same strongly connected components as G?

The correct option is B G2=(V,E2)where E2={(u,v)|(u,v)ϵ E}G = (V, E) is directed graph G2=(v,E2)where E2={(u,v)|(v,u) ϵ E} G and G2 has same strongly connected components only the difference in G2 is that all edges of G have been reversed the direction.

Let G = (V, E) be a directed graph where $V_{1}$ the set of vertices and E the set of edges. The which one of the following graphs has the same strongly connected components as G?