Search Results for ""

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

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

In December 1920, M. Schönfinkel presented in a report to the Mathematical Society in Göttingen a new type of formal logic based on the concept of a generalized function ...

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 matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...

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 conjugate transpose of an m×n matrix A is the n×m matrix defined by A^(H)=A^_^(T), (1) where A^(T) denotes the transpose of the matrix A and A^_ denotes the conjugate ...