Search Results for ""

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

After a half rotation of the coin on the left around the central coin (of the same radius), the coin undergoes a complete rotation. In other words, a coin makes two complete ...

A metric space X which is not complete has a Cauchy sequence which does not converge. The completion of X is obtained by adding the limits to the Cauchy sequences. For ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...

Let 0<k^2<1. The incomplete elliptic integral of the third kind is then defined as Pi(n;phi,k) = int_0^phi(dtheta)/((1-nsin^2theta)sqrt(1-k^2sin^2theta)) (1) = ...

In 1657, Fermat posed the problem of finding solutions to sigma(x^3)=y^2, and solutions to sigma(x^2)=y^3, where sigma(n) is the divisor function (Dickson 2005). The first ...

A Fréchet space is a complete and metrizable space, sometimes also with the restriction that the space be locally convex. The topology of a Fréchet space is defined by a ...

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...