Search Results for ""

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The integral transform defined by (Kphi)(x)=int_0^infty(x^2-t^2)_+^(lambda/2)P_nu^lambda(t/x)phi(t)dt, where y_+^alpha is the truncated power function and P_nu^lambda(x) is ...

Since the derivative of a constant is zero, any constant may be added to an indefinite integral (i.e., antiderivative) and will still correspond to the same integral. Another ...

Hilbert-Schmidt theory is the study of linear integral equations of the Fredholm type with symmetric integral kernels K(x,t)=K(t,x).

The integral transform (Kf)(x)=int_0^inftysqrt(xt)K_nu(xt)f(t)dt, where K_nu(x) is a modified Bessel function of the second kind. Note the lower limit of 0, not -infty as ...

The integral transform defined by (Kphi)(x)=int_0^inftyG_(pq)^(mn)(xt|(a_p); (b_q))phi(t)dt, where G_(pq)^(mn) is a Meijer G-function. Note the lower limit of 0, not -infty ...

The theory and applications of Laplace transforms and other integral transforms.

The integral transform (Kf)(x)=Gamma(p)int_0^infty(x+t)^(-p)f(t)dt. Note the lower limit of 0, not -infty as implied in Samko et al. (1993, p. 23, eqn. 1.101).