Search Results for ""

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

The surface which is the inverse of the ellipsoid in the sense that it "goes in" where the ellipsoid "goes out." It is given by the parametric equations x = acos^3ucos^3v (1) ...

The Barth decic is a decic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 345. It is given by the ...

The Bernoulli inequality states (1+x)^n>1+nx, (1) where x>-1!=0 is a real number and n>1 an integer. This inequality can be proven by taking a Maclaurin series of (1+x)^n, ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...

Let S be a collection of subsets of a set X, mu:S->[0,infty] a set function, and mu^* the outer measure induced by mu. The measure mu^_ that is the restriction of mu^* to the ...

Assume that f is a nonnegative real function on [0,infty) and that the two integrals int_0^inftyx^(p-1-lambda)[f(x)]^pdx (1) int_0^inftyx^(q-1+mu)[f(x)]^qdx (2) exist and are ...