Search Results for ""

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...

The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...

Twin primes are pairs of primes of the form (p, p+2). The term "twin prime" was coined by Paul Stäckel (1862-1919; Tietze 1965, p. 19). The first few twin primes are n+/-1 ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...