Computer Sciences > Gate 2014 Set-1 > Graph Theory
Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G ?
A
G1 = (V,E1) where E1={(u,v)∣(u,v)∉E}
B
G2 = (V,E2) where E2={(u,v)∣(v,u)∈E}
C
G3 = (V,E3) where E3={(u,v)∣ there is a path of length ≤2 from u to v in E}
D
G4= (V4,E) where V4 is the set of vertices in G which are not isolated

Correct : Graph Theory

Similar Questions

In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, a...
#91 MCQ
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, a...
#91 MCQ
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, a...
#91 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: