Search Results for ""

A map f from a metric space M=(M,d) to a metric space N=(N,rho) is said to be uniformly continuous if for every epsilon>0, there exists a delta>0 such that ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

There are a number of algebraic identities involving sets of four vectors. An identity known as Lagrange's identity is given by (AxB)·(CxD)=(A·C)(B·D)-(A·D)(B·C) (1) ...

The vector triple product identity is also known as the BAC-CAB identity, and can be written in the form Ax(BxC) = B(A·C)-C(A·B) (1) (AxB)xC = -Cx(AxB) (2) = -A(B·C)+B(A·C). ...

The notion of weak amenability was first introduced by Bade et al. (1987), who termed a commutative Banach algebra A "weakly amenable" if every continuous derivation from A ...

Linear Algebra

The Smale horseshoe map consists of a sequence of operations on the unit square. First, stretch in the y direction by more than a factor of two, then compress in the x ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...