Search Results for ""

The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].

There are a number of attractive polyhedron compounds of two cubes. The first (left figures) is obtained by allowing two cubes to share opposite polyhedron vertices then ...

There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...

Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...

A cubic curve is an algebraic curve of curve order 3. An algebraic curve over a field K is an equation f(X,Y)=0, where f(X,Y) is a polynomial in X and Y with coefficients in ...

Cubic nonhamiltonian graphs are nonhamiltonian graphs that are also cubic. The numbers of connected cubic nonhamiltonian graphs on n=10, 12, ... nodes are 2, 5, 35, 219, ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...