graphe de Coxeter
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
- Instance of
- triangle-free graph
- Named after
- Harold Scott MacDonald Coxeter
- Image
- Coxeter graph.svg
- Has parts of class
- edge
Show 7 more facts
- Commons category
- Coxeter graph
- studied by
- graph theory
- graph diameter
- 4
- graph girth
- 7
- maintained by WikiProject
- WikiProject Mathematics
- graph radius
- 4
- described at URL
- aeb.win.tue.nl/graphs/Coxeter.html
via Wikidata · CC0
Article · Français
En théorie des graphes, le graphe de Coxeter est un graphe cubique symétrique à 28 sommets et 42 arêtes. Il est nommé en l'honneur de H.S.M. Coxeter qui l'appelait « My graph ».
Abstract from DBpedia / Wikipedia · CC BY-SA