Search Results for ""

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...

Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...

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

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

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

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