Search Results for ""

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

There are a number of attractive polyhedron compounds of two cubes. The first (left figures) is obtained by allowing two cubes to share opposite polyhedron vertices then ...

The path traced out by a point P on the edge of a circle of radius b rolling on the outside of a circle of radius a. An epicycloid is therefore an epitrochoid with h=b. ...

An Euler brick is a cuboid that possesses integer edges a>b>c and face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2). (3) If the ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

The great dodecahedron is the Kepler-Poinsot polyhedron whose dual is the small stellated dodecahedron. It is also uniform polyhedron with Maeder index 35 (Maeder 1997), ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...