Search Results for ""

The Ionin-Kharaghani graph is a strongly regular graph on 765 vertices and 73440 edges. It has regular parameters (nu,k,lambda,mu)=(765,192,48,48). It is implemented in the ...

A general integral transform is defined by g(alpha)=int_a^bf(t)K(alpha,t)dt, where K(alpha,t) is called the integral kernel of the transform.

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A type of integral named after Henstock and Kurzweil. Every Lebesgue integrable function is HK integrable with the same value.

J_m(x)=(2x^(m-n))/(2^(m-n)Gamma(m-n))int_0^1J_n(xt)t^(n+1)(1-t^2)^(m-n-1)dt, where J_m(x) is a Bessel function of the first kind and Gamma(x) is the gamma function.

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The honeycomb toroidal graph HTG(m,2n,s) on 2nm vertices for m, n, and s positive integers satisfying n>1 and m+s is even is defined as the graph on vertex set u_(ij) for ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

Euler integration was defined by Schanuel and subsequently explored by Rota, Chen, and Klain. The Euler integral of a function f:R->R (assumed to be piecewise-constant with ...