SmallestCyclicGroupGraph returns a smallest nontrivial graph whose automorphism group is cyclic.

StronglyConnectedComponents[g] gives the strongly connected components of directed graph g as lists of vertices.

SymmetricGroupIndex[n, x] returns the cycle index of the symmetric group on n symbols, expressed as a polynomial in x[1], x[2], ..., x[n].

TableauQ[t] yields True if and only if t represents a Young tableau.

TableauxToPermutation[t_1, t_2] constructs the unique permutation associated with Young tableaux t_1 and t_2, where both tableaux have the same shape.

ThomassenGraph returns a hypotraceable graph, a graph G that has no Hamiltonian path but whose subgraph G - v for every vertex v has a Hamiltonian path.

TopologicalSort[g] gives a permutation of the vertices of the directed acyclic graph g such that an edge (i, j) implies that vertex i appears before vertex j.

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