Search Results for ""

A mathematical structure A is said to be closed under an operation + if, whenever a and b are both elements of A, then so is a+b. A mathematical object taken together with ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

Logic is the formal mathematical study of the methods, structure, and validity of mathematical deduction and proof. According to Wolfram (2002, p. 860), logic is the most ...

The McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...

A Mrs. Perkins's quilt is a dissection of a square of side n into a number of smaller squares. The name "Mrs. Perkins's Quilt" comes from a problem in one of Dudeney's books, ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

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

A 24-sided polygon. The regular icositetragon is constructible. For side length 1, the inradius r, circumradius R, and area A are given by r = 1/2(2+sqrt(2)+sqrt(3)+sqrt(6)) ...

The Glaisher-Kinkelin constant A is defined by lim_(n->infty)(H(n))/(n^(n^2/2+n/2+1/12)e^(-n^2/4))=A (1) (Glaisher 1878, 1894, Voros 1987), where H(n) is the hyperfactorial, ...