Search Results for ""

The term "rhombicuboctahedron" is most commonly used (e.g., Wenninger 1989, p. 27; Maeder 1997) to refer to the 26-faced Archimedean solid with faces 8{3}+18{4}. Cundy and ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

A number traditionally associated with bad luck. A so-called baker's dozen is equal to 13. Fear of the number 13 is called triskaidekaphobia. There are 13 Archimedean solids. ...

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 packing of polyhedron in three-dimensional space. A polyhedron which can pack with no holes or gaps is said to be a space-filling polyhedron. Betke and Henk (2000) present ...

A tetradecahedron is a 14-sided polyhedron, sometimes called a tetrakaidecahedron. Examples are illustrated above and summarized in the following table. name family augmented ...