Search Results for ""

The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

The sine function sinx is one of the basic functions encountered in trigonometry (the others being the cosecant, cosine, cotangent, secant, and tangent). Let theta be an ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

The Spencer-Brown form is a simple mathematical concept that formalizes what a mathematical object is formally identical to what it is not (Spencer-Brown 1997, pp. ix and ...

The spherical harmonics Y_l^m(theta,phi) are the angular portion of the solution to Laplace's equation in spherical coordinates where azimuthal symmetry is not present. Some ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

The mathematical study of the likelihood and probability of events occurring based on known information and inferred by taking a limited number of samples. Statistics plays ...

Expanding the Riemann zeta function about z=1 gives zeta(z)=1/(z-1)+sum_(n=0)^infty((-1)^n)/(n!)gamma_n(z-1)^n (1) (Havil 2003, p. 118), where the constants ...