Search Results for ""

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

A spectrum containing the real numbers larger than Freiman's constant.

A benzenoid is a fusene that is a subgraph of the regular hexagonal lattice (i.e., a simply connected polyhex). The numbers of n-hexagon benzenoids for n=1, 2, ... are 1, 1, ...

A cross section of a solid is a plane figure obtained by the intersection of that solid with a plane. The cross section of an object therefore represents an infinitesimal ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A zero function is a function that is almost everywhere zero. The function sometimes known as "the zero function" is the constant function with constant c=0, i.e., f(x)=0 ...

Always increasing; never remaining constant or decreasing. Also called strictly increasing.

The property of being the only possible solution (perhaps modulo a constant, class of transformation, etc.).