Search Results for ""

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

A permutation group in which the permutations are limited to transpositions.

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

Every real number is negative, 0, or positive. The law is sometimes stated as "For arbitrary real numbers a and b, exactly one of the relations a<b, a=b, a>b holds" (Apostol ...

A projection of a link is tricolorable if each of the strands in the projection can be colored in one of three different colors such that, at each crossing, all three colors ...

To truncate a real number is to discard its noninteger part. Truncation of a (positive) number x therefore corresponds to taking the floor function |_x_|. Truncation also ...

1 uncia=1/(12). The word uncia was Latin for a unit equal to 1/12 of another unit called the as. The words "inch" (1/12 of a foot) and "ounce" (originally 1/12 of a pound and ...

A game in which a certain player can always win when he plays properly. All categorical games are unfair (Steinhaus 1999, p. 16), as is the game of Marienbad.

A unimodal sequence is a finite sequence that first increases and then decreases. A sequence {s_1,s_2,...,s_n} is unimodal if there exists a t such that s_1<=s_2<=...<=s_t ...

A group whose left Haar measure equals its right Haar measure.