Search Results for ""

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

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

Kontsevich's integral is a far-reaching generalization of the Gauss integral for the linking number, and provides a tool to construct the universal Vassiliev invariant of a ...

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

J_n(x)=1/piint_0^picos(ntheta-xsintheta)dtheta, where J_n(x) is a Bessel function of the first kind.

alpha(x) = 1/(sqrt(2pi))int_(-x)^xe^(-t^2/2)dt (1) = sqrt(2/pi)int_0^xe^(-t^2/2)dt (2) = 2Phi(x) (3) = erf(x/(sqrt(2))), (4) where Phi(x) is the normal distribution function ...

F(x) = Li_2(1-x) (1) = int_(1-x)^0(ln(1-t))/tdt, (2) where Li_2(x) is the dilogarithm.

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

A k×m×n hexagonal grid graph is a graph of adjoined hexagons consisting of k hexagons along the horizontal triangular axis, m along the northeast axis, and n along the ...