Search Results for ""

A set n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). If the sum of ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A multiple integral is a set of integrals taken over n>1 variables, e.g., int...int_()_(n)f(x_1,...,x_n)dx_1...dx_n. An nth-order integral corresponds, in general, to an ...

Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...

A surface such as the Möbius strip or Klein bottle (Gray 1997, pp. 322-323) on which there exists a closed path such that the directrix is reversed when moved around this ...

If T is a linear transformation of R^n, then the null space Null(T), also called the kernel Ker(T), is the set of all vectors X such that T(X)=0, i.e., Null(T)={X:T(X)=0}. ...

An oval is a curve resembling a squashed circle but, unlike the ellipse, without a precise mathematical definition. The word oval derived from the Latin word "ovus" for egg. ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...