Search Results for ""

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

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

A set of statistical distributions having the same variance.

A system of equations is any set of simultaneous equations.

Also called indiscrete topology, the trivial topology is the smallest topology on a set X, namely the one in which the only open sets are the empty set and the entire set X. ...

A Steiner system S(t,k,v) is a set X of v points, and a collection of subsets of X of size k (called blocks), such that any t points of X are in exactly one of the blocks. ...

Let U subset= C be a domain, and let f be an analytic function on U. Then if there is a point z_0 in U such that |f(z_0)|>=|f(z)| for all z in U, then f is constant. The ...

Gaussian curvature, sometimes also called total curvature (Kreyszig 1991, p. 131), is an intrinsic property of a space independent of the coordinate system used to describe ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...