Work out adjacency matrix instantly with clear inputs, formula shown and shareable results.
An adjacency matrix records a 1 where two vertices are joined. Row sums give the degrees, and raising the matrix to the power k counts walks of length k between every pair of vertices.
Walk counting
(Aᵏ)ᵢⱼ = number of walks of length k from vertex i to vertex j
Degrees are 2, 3, 3, 2 summing to 10, so there are 5 edges, and A² totals 26 walks of length two.
Its matrix is not symmetric, so an entry can be 1 in one direction and 0 in the other.