Search Results for ""

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

The x-axis is the horizontal axis of a two-dimensional plot in Cartesian coordinates that is conventionally oriented to point to the right (left figure). In three dimensions, ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closed if for any sequence of vectors v_n in D(A) such that v_n->v and Av_n->x as n->infty, it ...

Let A, B, and C be three polar vectors, and define V_(ijk) = |A_i B_i C_i; A_j B_j C_j; A_k B_k C_k| (1) = det[A B C], (2) where det is the determinant. The V_(ijk) is a ...

Given a differential p-form q in the exterior algebra ^ ^pV^*, its envelope is the smallest subspace W such that q is in the subspace ^ ^pW^* subset ^ ^pV^*. Alternatively, W ...

The G-transform of a function f(x) is defined by the integral (Gf)(x)=(G_(pq)^(mn)|(a_p); (b_q)|f(t))(x) (1) =1/(2pii)int_sigmaGamma[(b_m)+s, 1-(a_n)-s; (a_p^(n+1))+s, ...

A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...