Search Results for ""

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...

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

The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...

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

Sylvester's four-point problem asks for the probability q(R) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester ...

The tangent function is defined by tanx=(sinx)/(cosx), (1) where sinx is the sine function and cosx is the cosine function. The notation tgx is sometimes also used ...