Search Results for ""

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

Clebsch-Gordan coefficients are mathematical symbol used to integrate products of three spherical harmonics. Clebsch-Gordan coefficients commonly arise in applications ...

The Clebsch diagonal cubic is a cubic algebraic surface given by the equation x_0^3+x_1^3+x_2^3+x_3^3+x_4^3=0, (1) with the added constraint x_0+x_1+x_2+x_3+x_4=0. (2) The ...

A notation used to describe curves. The fundamental principle of Clebsch-Aronhold notation states that if each of a number of forms be replaced by a power of a linear form in ...

A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...