Search Results for ""

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

The power of a fixed point A with respect to a circle of radius r and center O is defined by the product p=AP×AQ, (1) where P and Q are the intersections of a line through A ...

A circumconic is a conic section that passes through the vertices of a triangle (Kimberling 1998, p. 235). Every circumconic has a trilinear equation of the form ...

Clebsch-Gordan coefficients are mathematical symbol used to integrate products of three spherical harmonics. Clebsch-Gordan coefficients commonly arise in applications ...

Also called Macaulay ring, a Cohen Macaulay ring is a Noetherian commutative unit ring R in which any proper ideal I of height n contains a sequence x_1, ..., x_n of elements ...

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

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

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...