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

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

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...

A cyclide is a pair of focal conics which are the envelopes of two one-parameter families of spheres, sometimes also called a cyclid. The cyclide is a quartic surface, and ...

A cylindrical segment, sometimes also called a truncated cylinder, is the solid cut from a circular cylinder by two (or more) planes. If there are two cutting planes, one ...

A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

The classic treatise in geometry written by Euclid and used as a textbook for more than 1000 years in western Europe. An Arabic version The Elements appears at the end of the ...