Clebsch graph

In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80 edges. The 80-edge graph is the dimension-5 halved cube graph; it was called the Clebsch graph name by Seidel (1968) because of its relation to the configuration of 16 lines on the quartic surface discovered in 1868 by the German mathematician Alfred Clebsch. The 40-edge variant is the dimension-5 folded cube graph; it is also known as the GreenwoodGleason graph after the work of Robert E. Greenwood and Andrew M. Gleason (1955), who used it to evaluate the Ramsey number R(3,3,3) = 17.

Clebsch graph
Named afterAlfred Clebsch
Vertices16
Edges40
Radius2
Diameter2
Girth4
Automorphisms1920
Chromatic number4
Chromatic index5
Book thickness4
Queue number3
PropertiesStrongly regular
Hamiltonian
Cayley graph
Vertex-transitive
Edge-transitive
Distance-transitive.
Table of graphs and parameters
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.