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

Strong is an option to ConnectedQ that seeks to determine if a directed graph is strongly connected.

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

Tableaux[p] constructs all tableaux having a shape given by integer partition p.

TetrahedralGraph returns the graph corresponding to the tetrahedron, a Platonic solid.

ThickDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.

ThinDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.

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.

TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.