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 mathematical relationship transforming a function f(x) to the form f(x+a).

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 ...

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

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 ...

A generalization of spun knots due to Zeeman. This method produces four-dimensional knot types that cannot be produced by ordinary spinning.

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 ...