ConceptTheory & Algos
Adjacency matrix power and walks
The -th entry of the -th power of a graph's adjacency matrix equals the number of directed walks of length from vertex to vertex .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.