Search Results for ""

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...

The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...

The small cubicuboctahedron is the uniform polyhedron with Maeder index 13 (Maeder 1997), Wenninger index 69 (Wenninger 1989), Coxeter index 38 (Coxeter et al. 1954), and ...

The small ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. 106-107), Coxeter index 39 ...

The small dodecicosidodecahedron is the uniform polyhedron with Maeder index 33 (Maeder 1997), Wenninger index 72 (Wenninger 1989), Coxeter index 42 (Coxeter et al. 1954), ...

The small stellated truncated dodecahedron, also called the quasitruncated small stellated dodecahedron, is the uniform polyhedron with Maeder index 58 (Maeder 1997), ...