Search Results for ""

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

Degen's eight-square identity is the incredible polynomial identity (1) found around 1818 by the Danish mathematician Ferdinand Degen (1766-1825). It was subsequently ...

A difference-differential equation is a two-variable equation consisting of a coupled ordinary differential equation and recurrence equation. In older literature, the term ...

A statistical distribution whose variables can take on only discrete values. Abramowitz and Stegun (1972, p. 929) give a table of the parameters of most common discrete ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

A set S is discrete in a larger topological space X if every point x in S has a neighborhood U such that S intersection U={x}. The points of S are then said to be isolated ...

The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...

A compound of five regular dodecahedra with the symmetry of the icosahedron (Wenninger 1983, pp. 145-147) can be constructed by taking a dodecahedron with top and bottom ...

A stationary point process X is said to drive a model of continuum percolation theory if one of the characterizing axioms of the model hinges on the existence of X. In this ...