граф Коксетера
Sign in to save3-регулярный граф с 28 вершинами и 42 рёбрами
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
Article · Русский
Граф Коксетера — 3-регулярный граф с 28 вершинами и 42 рёбрам Все кубические дистанционно-регулярные графы известны, граф Коксетера — один из 13-ти таких графов.
Abstract from DBpedia / Wikipedia · CC BY-SA