Search Results for ""

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 octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

The class of all regular sequences of particularly well-behaved functions equivalent to a given regular sequence. A distribution is sometimes also called a "generalized ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...

Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...

If x is a regular patch on a regular surface in R^3 with normal N^^, then x_(uu) = Gamma_(11)^1x_u+Gamma_(11)^2x_v+eN^^ (1) x_(uv) = Gamma_(12)^1x_u+Gamma_(12)^2x_v+fN^^ (2) ...

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

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

A regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...