Search Results for ""

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

For R[mu+nu]>0, |argp|<pi/4, and a>0, where J_nu(z) is a Bessel function of the first kind, Gamma(z) is the gamma function, and _1F_1(a;b;z) is a confluent hypergeometric ...

Consider the differential equation satisfied by w=z^(-1/2)W_(k,-1/4)(1/2z^2), (1) where W is a Whittaker function, which is given by ...

Although Bessel functions of the second kind are sometimes called Weber functions, Abramowitz and Stegun (1972) define a separate Weber function as ...

int_0^inftyJ_0(ax)cos(cx)dx={0 a<c; 1/(sqrt(a^2-c^2)) a>c (1) int_0^inftyJ_0(ax)sin(cx)dx={1/(sqrt(c^2-a^2)) a<c; 0 a>c, (2) where J_0(z) is a zeroth order Bessel function of ...