1,114 views
0 votes
0 votes

in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is?

 a. weakly connected

  1. unilaterally connected
  2. strongly connected
  3. disconnected

1 Answer

1 votes
1 votes

Unilaterally Connected:- 

A directed graph is said to be unilaterally connected if for any pair of nodes at least one of the nodes is reachable from the other.

Refer :- this.

hence, b.) Unilaterally connected is the answer. 

 

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
177 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
0 votes
1 answer
3
Dhiraj_777 asked May 4, 2023
488 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
0 votes
0 votes
1 answer
4
Sahil_Lather asked Apr 15, 2023
439 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...