Search Results for ""

The kei_nu(z) function is defined as the imaginary part of e^(-nupii/2)K_nu(ze^(pii/4))=ker_nu(z)+ikei_nu(z), (1) where K_nu(z) is a modified Bessel function of the second ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

A modified spherical Bessel function of the first kind (Abramowitz and Stegun 1972), also called a "spherical modified Bessel function of the first kind" (Arfken 1985), is ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

A graph that is not finite is called infinite.

A graph for which every node has finite degree.

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

A real function is said to be differentiable at a point if its derivative exists at that point. The notion of differentiability can also be extended to complex functions ...

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...