Search Results for ""

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 (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

Delta(x_1,...,x_n) = |1 x_1 x_1^2 ... x_1^(n-1); 1 x_2 x_2^2 ... x_2^(n-1); | | | ... |; 1 x_n x_n^2 ... x_n^(n-1)| (1) = product_(i,j; i>j)(x_i-x_j) (2) (Sharpe 1987). For ...

Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...

Vassiliev invariants, discovered around 1989, provided a radically new way of looking at knots. The notion of finite type (a.k.a. Vassiliev) knot invariants was independently ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

An analytic function approaches any given value arbitrarily closely in any epsilon-neighborhood of an essential singularity.

The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...

(d^2u)/(dz^2)+(du)/(dz)+(k/z+(1/4-m^2)/(z^2))u=0. (1) Let u=e^(-z/2)W_(k,m)(z), where W_(k,m)(z) denotes a Whittaker function. Then (1) becomes ...

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.