Search Results for ""

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

The regular icosahedron (often simply called "the" icosahedron) is the regular polyhedron and Platonic solid illustrated above having 12 polyhedron vertices, 30 polyhedron ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

The rhombic hexecontahedron is a 60-faced polyhedron that can be obtained by stellating the rhombic triacontahedron by placing a plane along each edge which is perpendicular ...

The (small) rhombicuboctahedron (Cundy and Rowlett 1989, p. 105), sometimes simply called the rhombicuboctahedron (Wenninger 1989, p. 27; Maeder 1997, Conway et al. 1999), is ...

A decahedron is a polyhedron having 10 faces. Examples include the 5-trapezohedron, augmented pentagonal prism (Johnson solid J_(52)), augmented tridiminished icosahedron ...

An m×n matrix which gives the possible outcome of a two-person zero-sum game when player A has m possible moves and player B n moves. The analysis of the matrix in order to ...

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

The regular octahedron, often simply called "the" octahedron, is the Platonic solid with six polyhedron vertices, 12 polyhedron edges, and eight equivalent equilateral ...