Search Results for ""

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

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

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

The arithmetic mean of a set of values is the quantity commonly called "the" mean or the average. Given a set of samples {x_i}, the arithmetic mean is x^_=1/Nsum_(i=1)^Nx_i. ...

How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...

The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

Given the Mertens function defined by M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function, Stieltjes claimed in an 1885 letter to Hermite that M(x)x^(-1/2) stays ...