Search Results for ""

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

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

A family of functors H_n(·) from the category of pairs of topological spaces and continuous maps, to the category of Abelian groups and group homomorphisms satisfies the ...

Euclidean n-space, sometimes called Cartesian space or simply n-space, is the space of all n-tuples of real numbers, (x_1, x_2, ..., x_n). Such n-tuples are sometimes called ...

The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...

Let M be a regular surface with v_(p),w_(p) points in the tangent space M_(p) of M. Then the first fundamental form is the inner product of tangent vectors, ...

Fredholm's theorem states that, if A is an m×n matrix, then the orthogonal complement of the row space of A is the null space of A, and the orthogonal complement of the ...

The full width at half maximum (FWHM) is a parameter commonly used to describe the width of a "bump" on a curve or function. It is given by the distance between points on the ...