Search Results for ""

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

Skewness is a measure of the degree of asymmetry of a distribution. If the left tail (tail at small end of the distribution) is more pronounced than the right tail (tail at ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

The deltoidal icositetrahedron is the 24-faced dual polyhedron of the small rhombicuboctahedron A_6 and Wenninger dual W_(13). It is also called the trapezoidal ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

The diminished rhombicosidodecahedron is a convex equilateral solid that is Johnson solid J_(76). This solid is the diminished polyhedron obtained by diminishing a small ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

A point where a stable and an unstable separatrix (invariant manifold) from the same fixed point or same family intersect. Therefore, the limits lim_(k->infty)f^k(X) and ...

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...