Search Results for ""

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...

The great dirhombicosidodecahedral graph is the skeleton of the great dirhombicosidodecahedron and the second octahedron 20-compound. It is illustrated above in a few ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

For positive integer n, the K-function is defined by K(n) = 1^12^23^3...(n-1)^(n-1) (1) = H(n-1), (2) where the numbers H(n)=K(n+1) are called hyperfactorials by Sloane and ...

Let U subset= C be an open set and f a real-valued continuous function on U. Suppose that for each closed disk D^_(P,r) subset= U and every real-valued harmonic function h ...

S(nu,z) = int_0^infty(1+t)^(-nu)e^(-zt)dt (1) = z^(nu-1)e^zint_z^inftyu^(-nu)e^(-u)du (2) = z^(nu/2-1)e^(z/2)W_(-nu/2,(1-nu)/2)(z), (3) where W_(k,m)(z) is the Whittaker ...

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...