Search Results for ""

A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...

A parallelohedron is a space-filling polyhedron that fills space using an infinite number of similarly situated copies (Tutton 1964, pp. 567 and 723; Coxeter 1973, pp. ...

The supersphere is the algebraic surface that is the special case of the superellipse with a=b=c. It has equation |x/a|^n+|y/a|^n+|z/a|^n=1 (1) or |x|^n+|y|^n+|z|^n=a^n (2) ...

The 60-faced dual polyhedron of the truncated dodecahedron A_(10) (Holden 1971, p. 55) and Wenninger dual W_(10). Wenninger (1989, p. 46) calls the small triambic icosahedron ...

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

The term rectification is sometimes used to refer to the determination of the length of a curve. Rectification also refers to the operation which converts the midpoints of ...

A deltahedron is a polyhedron whose faces are congruent equilateral triangles (Wells 1986, p. 73). Note that polyhedra whose faces could be triangulated so as to be composed ...

The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...