Register

ISRO2008-78

• edited by
4,005 views

1 Answer

Best answer
13 votes
13 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
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

77 votes
77 votes
12 answers
1
Kathleen asked Oct 4, 2014
34,799 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$
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
User Avatar
39 votes
39 votes
8 answers
2
Kathleen asked Sep 15, 2014
18,712 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}$
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}$
User Avatar
2 votes
2 votes
2 answers
3
go_editor asked Jun 13, 2016
4,345 views
ISRO2008-80
In C, what is the effect of a negative number in a field width specifier? the values are displayed right justified the values are displayed centered the values are displayed left justified the values are displayed as negative numbers
In C, what is the effect of a negative number in a field width specifier?the values are displayed right justifiedthe values are displayed centeredthe values are displayed...
User Avatar
7 votes
7 votes
4 answers
4
go_editor asked Jun 13, 2016
3,274 views
ISRO2008-79
Repeated execution of simple computation may cause compounding of round-off errors syntax errors run-time errors logic errors
Repeated execution of simple computation may cause compounding ofround-off errorssyntax errorsrun-time errorslogic errors
User Avatar
Link Copied!