Search Results for ""

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

A 15-sided polygon, sometimes also called the pentakaidecagon. For a regular pentadecagon with side length 1, the inradius r, circumradius R, and area A are r = ...

A 30-sided polygon. The regular triacontagon with side length 1 has inradius r, circumradius R, and area A given by r = 1/4(sqrt(15)+3sqrt(3)+sqrt(2)sqrt(25+11sqrt(5))) (1) R ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

A (general) octahedron is a polyhedron having eight faces. Examples include the 4-trapezohedron, augmented triangular prism (Johnson solid J_(49)), bislit cube, Dürer solid, ...

The 57-cell, also called the pentacontaheptachoron, is a regular self-dual locally projective polytope with 57 hemidodecahedral facets described by Coxeter (1982) and also ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

A (general) dodecahedron is a polyhedron having 12 faces. Examples include the Bilinski dodecahedron, decagonal prism, elongated square dipyramid (Johnson solid J_(15)), ...

The pentagonal antiprism is the antiprism having a regular pentagon for the top and bottom bases. It is also the uniform polyhedron with Maeder index 77 (Maeder 1997) and ...

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...