Search Results for ""

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

Any pair of equations giving the real part of a function as an integral of its imaginary part and the imaginary part as an integral of its real part. Dispersion relationships ...

The distribution parameter of a noncylindrical ruled surface parameterized by x(u,v)=sigma(u)+vdelta(u), (1) where sigma is the striction curve and delta the director curve, ...

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

A tensor t is said to satisfy the double contraction relation when t_(ij)^m^_t_(ij)^n=delta_(mn). (1) This equation is satisfied by t^^^0 = (2z^^z^^-x^^x^^-y^^y^^)/(sqrt(6)) ...

For R[a+b-c-d]<-1 and a and b not integers,

The quantity 12 is sometimes referred to as one dozen.

Given a contravariant basis {e^->_1,...,e^->_n}, its dual covariant basis is given by e^->^alpha·e^->_beta=g(e^->^alpha,e^->_beta)=delta_beta^alpha, where g is the metric and ...

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