# ISRO2008-78

2.1k views

Consider the graph shown in the figure below:

Which of the following is a valid strong component?

1. a, c, d
2. a, b, d
3. b, c, d
4. a, b, c

recategorized

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
0
what is unilaterally graph and give please give on example
0

A digraph is unilaterally connected if for every pair of points there is a path from one to the other (but not necessarily the other way around).

## Related questions

1
12.5k views
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
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}$