Adjacency Matrices (VCE SSCE General Mathematics): Flashcards

Matrix showing edges connecting each pair of vertices in a graph

$n \times n$ square matrix

Number of edges between the two vertices

No edge connecting those two vertices

Exactly one edge connecting those two vertices

Single edge connecting a vertex to itself

On the diagonal (where row and column labels match)

Vertices in 2 groups; edges only between groups, not within

Matrix is symmetric (entry at A,B equals entry at B,A)

Vertex names (e.g., $A$, $B$, $C$, $D$, $E$)