Adjacency matrix ( $A (G)$ )

The adjacency matrix of a finite simple graph has entry

A_{uv} = 1

u, v

are adjacent and zero otherwise.

For a directed or weighted graph, entries instead record directed adjacency or edge weights.

Table of contents
- Walk count from powers of an adjacency matrix Adjacency matrix

Walk count from powers of an adjacency matrix

For every nonnegative integer

k

, the entry

(A^{k})_{uv}

equals the number of length-

k

walks from

u

to

v

. This follows by induction, since matrix multiplication appends one adjacent vertex to each walk.

 Ancestors (5)

 Incoming links (31)

 Synonyms (1)

codex/adjacency-matrix-of-a-graph

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Adjacency matrix by

Wikipedia Bot  1

An adjacency matrix is a square matrix used to represent a finite graph. It indicates whether pairs of vertices (or nodes) in the graph are adjacent (i.e., connected directly by an edge) or not. Here's how it works: 1. **Matrix Structure**: The size of the adjacency matrix is \( n \times n \), where \( n \) is the number of vertices in the graph. Each row and column of the matrix corresponds to a vertex in the graph.

 Read the full article

  See all articles in the same topic Create my own version