Search Results for ""

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

The divergence theorem, more commonly known especially in older literature as Gauss's theorem (e.g., Arfken 1985) and also known as the Gauss-Ostrogradsky theorem, is a ...

The dodecahedron-small triambic icosahedron compound is a stellated form of a truncated icosahedron, but a different truncation than in the truncated icosahedron Archimedean ...

A (general) dodecahedron is a polyhedron having 12 faces. Examples include the Bilinski dodecahedron, decagonal prism, elongated square dipyramid (Johnson solid J_(15)), ...

A compound of five regular dodecahedra with the symmetry of the icosahedron (Wenninger 1983, pp. 145-147) can be constructed by taking a dodecahedron with top and bottom ...

A number of attractive 6-compounds of the regular dodecahedron can be constructed. The first (left figures) can be obtained by combining six dodecahedra, each rotated by 1/10 ...

The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...

A dyadic, also known as a vector direct product, is a linear polynomial of dyads AB+CD+... consisting of nine components A_(ij) which transform as (A_(ij))^' = ...

The angle obtained by drawing the auxiliary circle of an ellipse with center O and focus F, and drawing a line perpendicular to the semimajor axis and intersecting it at A. ...

The "echidnahedron" is the term for the spiky fourth icosahedron stellation (in the enumeration of Maeder 1994) apparently first used in the Netlib polyhedron database. It is ...