Search Results for ""

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

Cube duplication, also called the Delian problem, is one of the geometric problems of antiquity which asks, given the length of an edge of a cube, that a second cube be ...

Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

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 bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...