Search Results for ""

A heptahedral graph is a polyhedral graph on seven nodes. There are 34 nonisomorphic heptahedral graphs, as first enumerated by Kirkman (1862-1863) and Hermes (1899ab, 1900, ...

If A, B, and C are three points on one line, D, E, and F are three points on another line, and AE meets BD at X, AF meets CD at Y, and BF meets CE at Z, then the three points ...

If two points A and A^' are inverse (sometimes called conjugate) with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to ...

In general, a triakis octahedron is a non-regular icositetrahedron that can be constructed as a positive augmentation of regular octahedron. Such a solid is also known as a ...

The polyhedron compound consisting of the cuboctahedron and its dual, the rhombic dodecahedron, illustrated in the left figure above. The right figure shows the solid common ...

In functional analysis, the Banach-Alaoglu theorem (also sometimes called Alaoglu's theorem) is a result which states that the norm unit ball of the continuous dual X^* of a ...

The small ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. 106-107), Coxeter index 39 ...

The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...