Search Results for ""

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

Given a number z, the cube root of z, denoted RadicalBox[z, 3] or z^(1/3) (z to the 1/3 power), is a number a such that a^3=z. The cube root is therefore an nth root with ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...

Let P=alpha:beta:gamma be a point not on a sideline of a reference triangle DeltaABC. Let A^' be the point of intersection AP intersection BC, B^'=BP intersection AC, and ...

A limiting case in which a class of object changes its nature so as to belong to another, usually simpler, class. For example, the point is a degenerate case of the circle as ...

The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...

Given a real number x, find the powers of a base b that will shift the digits of x a number of places n to the left. This is equivalent to solving b^x=b^nx (1) or x=n+log_bx. ...