Which of following option is correct about properties of a diagraph?

(A) A digraph is strongly connected if there is a path from each vertex to its neighbouring vertex.
(B) A digraph which has no cycle is called a forest.
(C) The radius of a complete graph is 1 and diameter is 2 if the number of vertices is greater then 1.
(D) None of these.


Answer: (D)

Explanation:

1. A digraph is strongly connected if there is a path from each vertex to every other vertex in a graph.
2. An undirected graph which has no cycle is called a forest.
3. The radius of a complete graph is 1 and diameter is 1 if number of vertices is greater then 1.

None option is correct, so option (D) is true.

Quiz of this Question