Q24Single correct3 Marks11 Dec 2022

Suppose $G$ is a graph with 6 vertices $0, 1, 2, 3, 4, 5$ and the adjacency matrix of graph $G$ is $$A = \begin{bmatrix} 0 & 0 & 1 & 0 & 0 & 1 \\ 1 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 \end{bmatrix}$$ Which of the following statements is INCORRECT?

A

The graph G is a directed acyclic graph.

B

A possible topological sequence of the graph G is 1, 0, 5, 2, 3, 4.

C

From vertex 0, every other vertex is reachable.

D

The longest path in the graph G has length 5, in terms of number of edges.