Search Results for ""

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

The three points determined on three coplanar edges of a tetrahedron by the external bisecting planes of the opposite dihedral angles are collinear. Furthermore, this line ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...

A system of circles obtained by multiplying each radius in a coaxal system by a constant. The Tucker circles are a coaxaloid system (Johnson 1929, p. 277).

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

A monoid that is commutative i.e., a monoid M such that for every two elements a and b in M, ab=ba. This means that commutative monoids are commutative, associative, and have ...

The computational paradigm is a term introduced by Wolfram (2002, 2021) to describe the idea of using simple programs rather than mathematical equations (the latter of which ...

Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...