Let A be an adjacency matrix of a graph G. The ijth entry in the matrix AK , gives
A. The number of paths of length K from vertex Vi to vertex Vj.
B. Shortest path of K edges from vertex Vi to vertex Vj.
C. Length of a Eulerian path from vertex Vi to vertex Vj.
D. Length of a Hamiltonian cycle from vertex Vi to vertex Vj.
Answer:B
Let A be an adjacency matrix of a graph G. The ijth entry in the matrix AK , gives
A. The number of paths of length K from vertex Vi to vertex Vj. B. Shortest path of K edges from vertex Vi to vertex Vj. C. Length of a Eulerian path from vertex Vi to vertex Vj. D. Length of a Hamiltonian cycle from vertex Vi to vertex Vj.