Search Results for ""

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...

The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...

Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...

For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...

A general quartic surface defined by x^4+y^4+z^4+a(x^2+y^2+z^2)^2+b(x^2+y^2+z^2)+c=0 (1) (Gray 1997, p. 314). The above two images correspond to (a,b,c)=(0,0,-1), and ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

A graceful permutation sigma on n letters is a permutation such that {|sigma(i)-sigma(i+1)|:i=1,2,...,n-1}={1,2,...,n-1}. For example, there are four graceful permutations on ...

If A is a graded module and there exists a degree-preserving linear map phi:A tensor A->A, then (A,phi) is called a graded algebra. Cohomology is a graded algebra. In ...