Search Results for ""

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

The complete elliptic integral of the first kind K(k), illustrated above as a function of the elliptic modulus k, is defined by K(k) = F(1/2pi,k) (1) = ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

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

A curve with polar coordinates, r=b+asectheta (1) studied by the Greek mathematician Nicomedes in about 200 BC, also known as the cochloid. It is the locus of points a fixed ...

The confluent hypergeometric function of the second kind gives the second linearly independent solution to the confluent hypergeometric differential equation. It is also ...