Register

ISRO CSE 2008 | Question: 78

• edited by
4,995 views

1 Answer

Best answer
14 14 votes

A directed graph is strongly connected if there is a path between all pairs of vertices.

So given graph has a b c as a strong component.

• selected by
Voting & Accepting an answer helps improve the community
Answer:
← Previous · ISRO CSE 2008 | Ques...Next → · ISRO CSE 2008 | Ques...
← Previous in category · UGC NET CSE | June 2...Next in category → · How many vertices an...
Position:
Show:

Related questions

123 123 votes
14 answers 14 answers
53.0k
53.0k views
Kathleen asked Oct 4, 2014
52,990 views
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
51 51 votes
9 answers 9 answers
32.6k
32.6k views
Kathleen asked Sep 15, 2014
32,568 views
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
1 1 vote
1 1 answer
4.3k
4.3k views
Anshul Shankar asked Jul 19, 2016
4,318 views
DRDO-2008
Adacency list is preferred over adjacency matrix when the graph is?A) planarB) DenseC) CliqueD) none of these
59 59 votes
6 answers 6 answers
21.6k
21.6k views
Ishrat Jahan asked Oct 28, 2014
21,614 views
GATE IT 2008 | Question: 27
$G$ is a simple undirected graph. Some vertices of $G$ are of odd degree. Add a node $v$ to $G$ and make it adjacent to each odd degree vertex of $G$. The resultant graph...