Adjacency matrix

From Wikiversity
Jump to navigation Jump to search

Every graph with labeled knots has an adjacency matrix, and every binary square matrix can be interpreted as the adjacency matrix of a graph.

6n-graph2.svg
8-cube.svg

Undirected octeract graph

Bitxor(m,n) is power of 2.svg
Z2^3; Lattice of subgroups Hasse diagram.svg

Lattice of subgroups of Z23

Z2^3; Lattice of subgroups Hasse diagram adjacency matrix (colored).svg
CV of roots of Gray * bit reversal, graphs.svg

See here

CV of roots of Gray * bit reversal.svg

Cayley graphs of S4[edit]

Symmetric group 4; Cayley graph 1,5,21 (Nauru Petersen); numbers.svg


Nauru graph

Symmetric group 4; Cayley graph 1,5,21 (adjacency matrix).svg
Symmetric group 4; Cayley graph 1,2,6; numbers.svg


Permutohedron graph

Symmetric group 4; Cayley graph 1,2,6 (adjacency matrix).svg
Symmetric group 4; Cayley graph 4,9; numbers.svg Symmetric group 4; Cayley graph 4,9 (adjacency matrix).svg