Search Results for ""

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...

Informally, a function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way function if 1. It is a one-way function, and 2. For fixed public key y in {0,1}^(l(n)), ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...

The trinomial triangle is a number triangle of trinomial coefficients. It can be obtained by starting with a row containing a single "1" and the next row containing three 1s ...

A triomino, also known as a tromino, is a 3-polyomino. There are two free polyominoes, (the same) two one-sided polyominoes, and 6 fixed polyominoes. The free polyominoes are ...

A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...