Let A be an adjacency matrix of a graph G. The
th
ij entry in the matrix
K
A, 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

1

Answers

2014-12-22T10:44:57+05:30

It gives (B) Shortest path of K edges from vertex Vi to Vj.
0