Search Results for ""

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

The BCH code is an error-correcting code that is a generalization of the Reed-Muller error-correcting code used by the Voyager 2 spacecraft.

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.

A property that passes from a topological space to all its quotient spaces. This is true for connectedness, local connectedness and separability, but not for any of the ...

The indefinite summation operator Delta^(-1) for discrete variables, is the equivalent of integration for continuous variables. If DeltaY(x)=y(x), then Delta^(-1)y(x)=Y(x).

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.