Search Results for ""

A 32-sided polygon. The regular icosidodecagon is a constructible polygon, and the regular icosidodecahedron of side length 1 has inradius r, circumradius R, and area A r = ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

17 is a Fermat prime, which means that the 17-sided regular polygon (the heptadecagon) is constructible using compass and straightedge (as proved by Gauss).

A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.

A point p on a regular surface M in R^3 is said to be elliptic if the Gaussian curvature K(p)>0 or equivalently, the principal curvatures kappa_1 and kappa_2 have the same ...

A point p on a regular surface M in R^3 is said to be hyperbolic if the Gaussian curvature K(p)<0 or equivalently, the principal curvatures kappa_1 and kappa_2, have opposite ...

Let M be a regular surface with v_(p),w_(p) points in the tangent space M_(p) of M. Then the third fundamental form is given by III(v_(p),w_(p))=S(v_(p))·S(w_(p)), where S is ...

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

A Bill picture is a sequence of nested regular polygons in which subsequent polygons are each rotated so that they begin one vertex further. The term was coined by Trott ...