Give a strongly connected orientation for the following grap

Give a strongly connected orientation for the following graph if one exists; if not, explain why.

Solution

Solution: - A diagraph G is said to be strongly connected if for every two vertices u and v in G there is a path from u to v as well as a path from v to u. In other words, a diagraph G is called strongly connected if there exists at least one directed path from every vertex to every other vertex.

In the given graph there is no direction in any branch. Hence the graph is not strongly connected