Search Results for ""

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...

Any real function u(x,y) with continuous second partial derivatives which satisfies Laplace's equation, del ^2u(x,y)=0, (1) is called a harmonic function. Harmonic functions ...

The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...

An important result in valuation theory which gives information on finding roots of polynomials. Hensel's lemma is formally stated as follows. Let (K,|·|) be a complete ...

A square matrix is called Hermitian if it is self-adjoint. Therefore, a Hermitian matrix A=(a_(ij)) is defined as one for which A=A^(H), (1) where A^(H) denotes the conjugate ...

A hexagon tiling is a tiling of the plane by identical hexagons. The regular hexagon forms a regular tessellation, also called a hexagonal grid, illustrated above. There are ...

The notion of a Hilbert C^*-module is a generalization of the notion of a Hilbert space. The first use of such objects was made by Kaplansky (1953). The research on Hilbert ...

The 34 distinct convergent hypergeometric series of order two enumerated by Horn (1931) and corrected by Borngässer (1933). There are 14 complete series for which ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...