Data Structures :: Graphs - Discussion
Home > Data Structures > Graphs > MCQs Questions Discussion
6 / 12
Choose the correct option.
Let A be an adjacency matrix of a graph G. The ij entry in the matrix A^k , gives
AThe number of paths of length K from vertex Vi to vertex Vj.
BShortest path of K edges from vertex Vi to vertex Vj.
CLength of a Eulerian path from vertex Vi to vertex Vj.
DLength of a Hamiltonian cycle from vertex Vi to vertex Vj.
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!