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.

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A mathematical relationship transforming a function f(x) to the form f(x+a).

Transparallel processing refers to this search for regularities in O(2^N) strings as if only one string of length N were concerned (as is possible if the strings form a ...

An exchange of two elements of an ordered list with all others staying the same. A transposition is therefore a permutation of two elements. For example, the swapping of 2 ...

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

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...

A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...

A transversal design TD_lambda(k,n) of order n, block size k, and index lambda is a triple (V, G, B) such that 1. V is a set of kn elements, 2. G is a partition of V into k ...