Category:3-bit Walsh permutations; Cayley graph with generators 136 and 421
Jump to navigation
Jump to search
This category is an image set. It should contain only images that have the same style, and should have a parent category that is purely topical.
136 is the 3-bit Gray code and 421 is the 3-bit bit-reversal permutation.
The 168 directed edges correspond to the former, the 84 undirected edges to the latter.
This graph does not have an obvious geometric interpretation.
It is related to the Coxeter graph, which can be generated from it in two steps:
- Replace each of the squares (formed by directed edges) by a node. Connect them, if the squares are connected.
The result is a 4-regular graph with 42 vertices and 84 edges, which contains 28 triangles. - Replace each triangle by a node. Connect them, if the triangles share a node.
The result is a 3-regular graph with 28 nodes and 42 edges. This is the Coxeter graph.
Media in category "3-bit Walsh permutations; Cayley graph with generators 136 and 421"
The following 6 files are in this category, out of 6 total.
-
3-bit Walsh permutations; Cayley 136 421 (cluster colors).svg 2,402 × 2,097; 672 KB
-
3-bit Walsh permutations; Cayley 136 421.svg 2,402 × 2,097; 677 KB
-
-
3-bit Walsh permutations; Cayley 136 421; 28 triples.svg 851 × 811; 83 KB
-
3-bit Walsh permutations; Cayley 136 421; 28 triples; Fano.svg 861 × 817; 65 KB
-
3-bit Walsh permutations; Cayley 136 421; tree.svg 1,010 × 1,011; 951 KB
.svg)
.svg)
