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)[2] 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 Greenwood–Gleason 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.[3][4][5]
^Cite error: The named reference MathWorld was invoked but never defined (see the help page).
^J. J. Seidel, Strongly regular graphs with (−1,1,0) adjacency matrix having eigenvalue 3, Lin. Alg. Appl. 1 (1968) 281-298.
^Clebsch, A. (1868), "Ueber die Flächen vierter Ordnung, welche eine Doppelcurve zweiten Grades besitzen", Journal für die reine und angewandte Mathematik, 69: 142–184.
^"The Clebsch Graph on Bill Cherowitzo's home page" (PDF). Archived from the original (PDF) on 2013-10-29. Retrieved 2011-05-21.
^Greenwood, R. E.; Gleason, A. M. (1955), "Combinatorial relations and chromatic graphs", Canadian Journal of Mathematics, 7: 1–7, doi:10.4153/CJM-1955-001-4, MR 0067467.
field of graph theory, the Clebschgraph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with...
srg(5, 2, 0, 1). The Petersen graph is an srg(10, 3, 0, 1). The Clebschgraph is an srg(16, 5, 0, 2). The Shrikhande graph is an srg(16, 6, 2, 2) which...
all cycle graphs, all square rook's graphs, the Petersen graph, and the 5-regular Clebschgraph. Ronse (1978). Gardiner (1976). Lachlan & Woodrow (1980)...
graph of dimension five is the Clebschgraph. The folded cube graph of dimension six is the Kummer graph, i.e. the Levi graph of the Kummer point-plane configuration...
In graph theory, a complete coloring is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently...
as the Clebschgraph, and is the complement of the folded cube graph of dimension five, which is the one more commonly called the Clebschgraph. It exists...
Nauru graph and the Desargues graph are integral. The Higman–Sims graph, the Hall–Janko graph, the Clebschgraph, the Hoffman–Singleton graph, the Shrikhande...
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
In graph theory, a branch of mathematics, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch...
0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 2-factor theorem (graph theory) 15 and 290 theorems (number theory) 2π theorem (Riemannian geometry)...
eigenvalues of orthogonal matrices lie on the unit circle, and Alfred Clebsch found the corresponding result for skew-symmetric matrices. Finally, Karl...
the Zhoubi Suanjing Chinese text which dates from 1046 BC to 256 BC. The Clebsch diagonal surface demonstrates the 27 lines on a cubic surface. Sphere eversion...
been written by Strauch (1849), Jellett (1850), Otto Hesse (1857), Alfred Clebsch (1858), and Carll (1885), but perhaps the most important work of the century...
algebraically closed field is that they are all rational, as shown by Alfred Clebsch in 1866. That is, there is a one-to-one correspondence defined by rational...
triangle by Gabriel Lamé in 1852, and the circular membrane by Alfred Clebsch in 1862. The elliptical drumhead was studied by Émile Mathieu, leading...
varieties which are defined by the vanishing of polynomials. For example, the Clebsch cubic illustrated on the right is an algebraic variety defined using a...
tensor product as a direct sum of irreducible representations is known as Clebsch–Gordan theory. In the case of the representation theory of the group SU(2)...
Global Information