Search Results for ""

A first compound of 20 octahedra can be constructed from the vertices of icositruncated dodecadodecahedron uniform polyhedron and a second from the vertices of the great ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular ...

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

A stellation is said to be fully supported if all its included cells are supported, i.e., if all its bottom faces are covered by their adjacent cells. In other words, every ...

A triacontahedron is a 30-faced polyhedron. Examples include the 14-gonal antiprism, biaugmented truncated cube (Johnson solid J_(67)), 15-gonal dipyramid, 28-gonal prism, ...

A trigonal trapezohedron, also called a trigonal deltohedron, is a polyhedron formed by six congruent rhombi. Special cases include the cube, acute golden rhombohedron, and ...