Search Results for ""

Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...

An idealized coin consists of a circular disk of zero thickness which, when thrown in the air and allowed to fall, will rest with either side face up ("heads" H or "tails" T) ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The great stellated dodecahedron is one of the Kepler-Poinsot polyhedra. It is also the uniform polyhedron with Maeder index 52 (Maeder 1997), Wenninger index 22 (Wenninger ...

The Harries-Wong graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries graph. The Harries-Wong graph ...