In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges.[1] It is one of the 13 known cubic distance-regular graphs.[2] It is named after Harold Scott MacDonald Coxeter.
^Weisstein, Eric W. "Coxeter Graph". MathWorld.
^Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.
field of graph theory, the Coxetergraph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is...
is a Coxeter matrix. The Coxeter matrix can be conveniently encoded by a Coxeter diagram, as per the following rules. The vertices of the graph are labelled...
the Coxetergraph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin diagrams, and the Todd–Coxeter algorithm. Coxeter was...
Petersen graph. Only five connected vertex-transitive graphs with no Hamiltonian cycles are known: the complete graph K2, the Petersen graph, the Coxeter graph...
the Desargues graph, the Nauru graph, the Coxetergraph, the Tutte–Coxetergraph, the Dyck graph, the Foster graph and the Biggs–Smith graph. W. T. Tutte...
"From the Coxetergraph to the Klein graph", Journal of Graph Theory, 70: 1–9, arXiv:1002.1960, doi:10.1002/jgt.20597, S2CID 754481. Coxeter (1950), "Self-dual...
{\displaystyle {\tilde {A}}_{n}} affine Coxeter group symmetry. It is represented by a Coxeter-Dynkin diagram as a cyclic graph of n + 1 nodes with one node ringed...
Klein graph, referenced as F056B, is the only cubic symmetric graph on 56 vertices which is not bipartite. It can be derived from the 28-vertex Coxeter graph...
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...
In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first...
In mathematics, a Coxeter element is an element of an irreducible Coxeter group which is a product of all simple reflections. The product depends on the...
as a graph, is Hamiltonian The Cayley graph of a finite Coxeter group is Hamiltonian (For more information on Hamiltonian paths in Cayley graphs, see...
question is the Coxeter plane of the symmetry group of the polygon, and the number of sides, h, is the Coxeter number of the Coxeter group. These polygons...
blank in the upper right, corresponding to directed graphs with underlying undirected graph any Coxeter diagram (of a finite group), can be defined formally...
He called it an 8-ic semi-regular figure. Its Coxeter symbol is 421, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end...
that the 56-vertex Klein cubic graph F{56}B, denoted here Γ', can be obtained from the 28-vertex Coxeter cubic graph Γ by zipping adequately the squares...
introduced in 1950 by H. S. M. Coxeter and was given its name in 1969 by Mark Watkins. In Watkins' notation, G(n, k) is a graph with vertex set { u 0 , u 1...
angle. A 4-node Coxeter-Dynkin diagram represents this tetrahedral graph with order-2 edges hidden. If many edges are order 2, the Coxeter group can be represented...
Global Information