Search Results for ""

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

A general prism is a polyhedron possessing two congruent polygonal faces and with all remaining faces parallelograms (Kern and Bland 1948, p. 28; left figure). A right prism ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

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

An n-trapezohedron, also called an antidipyramid, antibipyramid, or deltohedron (not to be confused with a deltahedron), is a solid composed of interleaved symmetric ...

The gyroelongated pentagonal pyramid is Johnson solid J_(11) and can be obtained by cumulating the top of a pentagonal antiprism, or alternately by replacing one pentagonal ...

The pentagonal prism is a prism having two pentagonal bases and five rectangular sides. It is a heptahedron. The regular right pentagonal prism is uniform polyhedron U_(76). ...

The pentagrammic prism is the self-intersecting uniform polyhedron with Maeder index 78 (Maeder 1997), Coxeter index 33 (Coxeter et al. 1954), and Har'El index 3 (Har'El ...

A polyhedron or plane tessellation is called semiregular if its faces are all regular polygons and its corners are alike (Walsh 1972; Coxeter 1973, pp. 4 and 58; Holden 1991, ...

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