Search Results for ""

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

j_n(z)=(z^n)/(2^(n+1)n!)int_0^picos(zcostheta)sin^(2n+1)thetadtheta, where j_n(z) is a spherical Bessel function of the first kind.

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

int_a^bf_1(x)dxint_a^bf_2(x)dx...int_a^bf_n(x)dx <=(b-a)^(n-1)int_a^bf_1(x)f_2(x)...f_n(x)dx, where f_1, f_2, ..., f_n are nonnegative integrable functions on [a,b] which are ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A type of integral containing gamma functions in its integrand. A typical such integral is given by ...

Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...

An integral equation of the form phi(x)=f(x)+lambdaint_(-infty)^inftyK(x,t)phi(t)dt (1) phi(x)=1/(sqrt(2pi))int_(-infty)^infty(F(t)e^(-ixt)dt)/(1-sqrt(2pi)lambdaK(t)). (2) ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...