Prove or disprove A connected graph with no cut vertices has

Prove or disprove: A connected graph with no cut vertices has a strongly connected orientation

Solution

Solution: - connected graph: - A graph G is called connected if there is at least one path between every pair of vertices in the graph G otherwise the graph G is called disconnected.

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

Therefore for strongly connected orientation direction between two edges is also required.

Therefore the statement is disapproved