Search Results for ""

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The metabiaugmented dodecahedron is a convex equilateral solid that is Johnson solid J_(60). The unit metabiaugmented dodecahedron has volume V=1/6(25+11sqrt(5)) (1) and Dehn ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

The parabiaugmented dodecahedron is a convex equilateral solid that is Johnson solid J_(60). The unit parabiaugmented dodecahedron has volume V=1/6(25+11sqrt(5)) (1) and Dehn ...

A sheaf is a presheaf with "something" added allowing us to define things locally. This task is forbidden for presheaves in general. Specifically, a presheaf F on a ...

The slant height of an object (such as a frustum, or pyramid) is the distance measured along a lateral face from the base to the apex along the "center" of the face. In other ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

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

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...