Search Results for ""

A 20-sided polygon. The regular icosagon is a constructible polygon, and the regular icosagon of unit side length has inradius r, circumradius R, and area A given by r = ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

An isohedron is a convex polyhedron with symmetries acting transitively on its faces with respect to the center of gravity. Every isohedron has an even number of faces ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

The Koolen-Riebeek graph is a weakly regular graph on 486 vertices with parameters (nu,k,lambda,mu)=(486,45,0,(0,9)). It is distance-regular but not distance-transitive with ...

The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

The nonagon, also known as an enneagon, is a 9-sided polygon. Although the term "enneagon" is perhaps preferable (since it uses the Greek prefix and suffix instead of the ...

Am octagonal prims is a prism composed of octagonal faces. The regular right octagonal prism of unit edge length has surface area and volume S = 4(3+sqrt(2)) (1) V = ...