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...

der Elasticität fester Körper (B. G. Teubner, 1862) Clebsch graph Clebsch representation Clebsch surface Eigenvalues and eigenvectors Helmholtz equation...

Grötzsch graph shares several properties with the Clebsch graph, a distance-transitive graph with 16 vertices and 40 edges: both the Grötzsch graph and the...

Schläfli graph as a strongly regular graph). These subgraphs are all isomorphic to the complement graph of the Clebsch graph. Since the Clebsch graph is triangle-free...

srg(5, 2, 0, 1). The Petersen graph is an srg(10, 3, 0, 1). The Clebsch graph is an srg(16, 5, 0, 2). The Shrikhande graph is an srg(16, 6, 2, 2) which...

graph of dimension five is the Clebsch graph. The folded cube graph of dimension six is the Kummer graph, i.e. the Levi graph of the Kummer point-plane configuration...

the graph are linked. The Clebsch graph contains many copies of the Petersen graph as induced subgraphs: for each vertex v of the Clebsch graph, the...

as the Clebsch graph, and is the complement of the folded cube graph of dimension five, which is the one more commonly called the Clebsch graph. It exists...

In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges...

K16, and consider the graph whose edges are precisely those edges that have the specified colour, we will get the Clebsch graph. It is known that there...

μ). Clebsch graph Cameron graph Petersen graph Hall–Janko graph Hoffman–Singleton graph Higman–Sims graph Paley graph of order 13 Shrikhande graph Schläfli...

In graph theory, a complete coloring is a (proper) vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently...

triangle-free 3-colorable graph, the tensor product of K 3 {\displaystyle K_{3}} with the Clebsch graph. The coloring of the graph may then be recovered by...

graphs, all square rook's graphs, the Petersen graph, and the 5-regular Clebsch graph. Ronse (1978). Gardiner (1976). Lachlan & Woodrow (1980). Buczak (1980);...

reformulation of the problem in terms of the clique number of certain graphs now known as Keller graphs. The related Minkowski lattice cube-tiling conjecture states...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

polytopes: 221, 321, and 421. The graph formed by the vertices and edges of the demipenteract is sometimes called the Clebsch graph, though that name sometimes...

Clebsch graphs of degree five and ten respectively. The Frankl–Rödl graph FR γ n {\displaystyle \operatorname {FR} _{\gamma }^{n}} is a regular graph...

Nauru graph and the Desargues graph are integral. The Higman–Sims graph, the Hall–Janko graph, the Clebsch graph, the Hoffman–Singleton graph, the Shrikhande...

only if this inequality holds for every larger n . {\displaystyle n.} The Clebsch surface has 27 exceptional lines can be defined over the real numbers....

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...

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...

eigenvalues of orthogonal matrices lie on the unit circle, and Alfred Clebsch found the corresponding result for skew-symmetric matrices. Finally, Karl...

(combinatorics) Graph structure theorem (graph theory) Grinberg's theorem (graph theory) Grötzsch's theorem (graph theory) Hajnal–Szemerédi theorem (graph theory)...

Q3 and Wagner graphs on 8 vertices. Symmetry relations are generally representative of the automorphism group of these graphs. Clebsch–Gordan coefficients...

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...

the groups in many cases, such as when the group is odd order or simple. Clebsch–Gordan coefficients 3-j symbol Racah W-coefficient 9-j symbol Representations...

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)...

the direct method in the calculus of variations. In the 1860s and 1870s, Clebsch, Gordan, Brill, and especially M. Noether studied algebraic functions and...

certain optimal control problems with multiple optimal solutions Legendre–Clebsch condition — second-order condition for solution of optimal control problem...