TransitiveQ[g] yields True if graph g defines a transitive relation.
TransitiveReduction[g] finds a smallest graph that has the same transitive closure as g.
TranslateVertices[v, {x, y}] adds the vector {x, y} to the vertex embedding location of each vertex in list v. TranslateVertices[g, {x, y}] translates the embedding of the ...
TransposePartition[p] reflects a partition p of k parts along the main diagonal, creating a partition with maximum part k.
TransposeTableau[t] reflects a Young tableau t along the main diagonal, creating a different tableau.
TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.
TravelingSalesman[g] finds an optimal traveling salesman tour in graph g.
TreeIsomorphismQ[t_1, t_2] yields True if the trees t_1 and t_2 are isomorphic. It yields False otherwise.
Tree
(Combinatorica Package Symbol) Tree is an option that informs certain functions that the user wants the output to be a tree.
TreeQ
(Combinatorica Package Symbol) TreeQ[g] yields True if graph g is a tree.