Search Results for ""

Cribbage is a game in which each of two players is dealt a hand of six cards. Each player then discards two of his six cards to a four-card "crib" which alternates between ...

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

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

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

A cylindrical segment, sometimes also called a truncated cylinder, is the solid cut from a circular cylinder by two (or more) planes. If there are two cutting planes, one ...

The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...

A 3-cusped hypocycloid, also called a tricuspoid. The deltoid was first considered by Euler in 1745 in connection with an optical problem. It was also investigated by Steiner ...

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

All the propositions in projective geometry occur in dual pairs which have the property that, starting from either proposition of a pair, the other can be immediately ...