Sign inSign in
ConceptMathematics

Graph Laplacian

The Laplacian of a d-regular graph defined as dd times the identity matrix minus the adjacency matrix.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Graham Cox

    UC Berkeley · Research

    A matrix representation of a graph that encodes its connectivity and structure.
    • 3:40Nodal surplus and the spectral decomposition of the cycle space

Lectures that assume it

8

Connections

19

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

2 lecturers. 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.