Search Results for ""

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

Polynomials M_k(x) which form the associated Sheffer sequence for f(t)=(e^t-1)/(e^t+1) (1) and have the generating function sum_(k=0)^infty(M_k(x))/(k!)t^k=((1+t)/(1-t))^x. ...

A class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...

Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...

A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...