Search Results for ""

The dodecadodecahedral graph is the skeleton of the dodecadodecahedron, great dodecahemicosahedron, and small dodecahemicosahedron. It is illustrated above in several ...

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

The elastica formed by bent rods and considered in physics can be generalized to curves in a Riemannian manifold which are a critical point for ...

A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...

Let b_1=1 and b_2=2 and for n>=3, let b_n be the least integer >b_(n-1) which can be expressed as the sum of two or more consecutive terms. The resulting sequence is 1, 2, 3, ...

A homogeneous space M is a space with a transitive group action by a Lie group. Because a transitive group action implies that there is only one group orbit, M is isomorphic ...

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...