Search Results for ""

The great dodecicosahedron is the uniform polyhedron with Maeder index 63 (Maeder 1997), Wenninger index 101 (Wenninger 1989), Coxeter index 79 (Coxeter et al. 1954), and ...

The great icosicosidodecahedron, not to be confused with the great icosahedron or great icosidodecahedron, is the uniform polyhedron with Maeder index 48 (Maeder 1997), ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

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 resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

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 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 (small) rhombicosidodecahedron (Cundy and Rowlett 1989, p. 111), sometimes simply called the rhombicosidodecahedron (Maeder 1997; Wenninger 1989, p. 27; Conway et al. ...

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