Search Results for ""

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

A chamfered icosahedron, also called a tritruncated rhombic triacontahedron, is a polyhedron obtained by chamfering a regular icosahedron. The illustration above shows ...

An equilateral polygon is a polygon whose edges are all of equal length (Williams 1979, pp. 31-32). The most prominent examples of equilateral polygons are the regular ...

Lagrange's continued fraction theorem, proved by Lagrange in 1770, states that any positive quadratic surd sqrt(a) has a regular continued fraction which is periodic after ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

In general, a triakis tetrahedron is a non-regular dodecahedron that can be constructed as a positive augmentation of a regular tetrahedron. Such a solid is also known as a ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...