search
Log In
6 votes
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
in Graph Theory
recategorized by
2.1k views

1 Answer

13 votes
 
Best answer

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

Answer:

Related questions

44 votes
9 answers
1
12.5k views
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
asked Oct 4, 2014 in Graph Theory Kathleen 12.5k views
31 votes
5 answers
2
6.5k views
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}$
asked Sep 16, 2014 in Graph Theory Kathleen 6.5k views
2 votes
2 answers
3
2.6k views
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
asked Jun 13, 2016 in Programming jothee 2.6k views
5 votes
4 answers
4
1.9k views
Repeated execution of simple computation may cause compounding of round-off errors syntax errors run-time errors logic errors
asked Jun 13, 2016 in Digital Logic jothee 1.9k views
...