Search Results for ""

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 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 ...

A hypergeometric function in which one parameter changes by +1 or -1 is said to be contiguous. There are 26 functions contiguous to _2F_1(a,b;c;x) taking one pair at a time. ...

An analytic function f on the unit disk is called schlicht if 1. f is one-to-one, 2. f(0)=0, and 3. f^'(0)=1, in which case it is written f in S. Schlicht functions have ...

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 ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

The Fox H-function is a very general function defined by where 0<=m<=q, 0<=n<=p, alpha_j,beta_j>0, and a_j,b_j are complex numbers such that no pole of Gamma(b_j-beta_js) for ...

The Owen T-function is defined as T(x,a)=1/(2pi)int_0^a(e^(-x^2(1+t^2)/2))/(1+t^2)dt. It is implemented in the Wolfram Language as OwenT[x, a]. A special value is given by ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...