Coxeter graph
Sign in to savecubic distance-regular graph with 28 vertices and 42 edges
Described at
Coxeter graph
aeb.win.tue.nl →This is the graph on the triangles in the Fano plane, where triangles are adjacent when they are disjoint. The Coxeter graph is maximally non-Hamiltonian: there is a Hamiltonian path between any two nonadjacent vertices. The girth is 7. The binary code generated by the cycles has parameters [42,15,7], with weight enumerator
Excerpt from a page describing this subject · 3,010 chars · not written by Vinony
Wikidata facts
- Image
- Coxeter graph.svg
Show 5 more facts
- Commons category
- Coxeter graph
- graph diameter
- 4
- graph girth
- 7
- graph radius
- 4
- described at URL
- aeb.win.tue.nl/graphs/Coxeter.html
via Wikidata · CC0
Connections
Harold Scott MacDonald Coxeter
Entity
mathematics
Entity
International Standard Book Number
Entity
Wayback Machine
Entity
digital object identifier
Entity
graph theory
Entity
octagon
Entity
heptagon
Entity
combination
Entity
Q118398
Entity
On-Line Encyclopedia of Integer Sequences
Entity
MathWorld
Entity
complete graph
Entity
Q22908627
Entity
node
Entity
adjacency matrix
Entity
graph coloring
Entity
Hamiltonian path
Entity
characteristic polynomial
Entity
Eric W. Weisstein
Entity