Sign inSign in
ConceptMathematics

Adjacency matrix

A square matrix used to represent a finite graph, where the element at row i and column j is 1 if there is an edge between vertices i and j, and 0 otherwise.
as Han Huang defines itMITThe wording closest to all 4 definitions
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

4

Each in their own terms, from the easiest level.

  • Julian Shun

    MIT · Undergraduate

    An n×nn \times n matrix with a 1 bit in row i and column j if an edge exists from vertex i to vertex j, and 0 otherwise.
    • 9:02Graph Optimization
  • Marten van Dijk

    MIT · Undergraduate

    A matrix containing entries representing whether an edge exists between two vertices in a graph.
  • Sebastian Cioaba

    UC Berkeley · Research

    A 0-1 symmetric matrix representing the connections between vertices in an undirected, simple graph.
    • 0:56Maximizing algebraic connectivity for graphs of given order and size.

Lectures that assume it

16

The first 12 are shown.

Connections

28

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

4 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.