Sign inSign in

Adjacency matrix power and walks

The (i,j)(i, j)-th entry of the kk-th power of a graph's adjacency matrix equals the number of directed walks of length kk from vertex viv_i to vertex vjv_j.
Watch it explained

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

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.