Isomorphic Graphs
Two Graphs which contain the same number of Vertices connected in thesame way are said to be isomorphic. Formally, two graphs 
and 
with Vertices 
are said to be isomorphic if there is a Permutation 
of 
such that 
is in the set ofEdges 
Iff 
is in the set of Edges 
.
References
Chartrand, G. ``Isomorphic Graphs.'' §2.2 in Introductory Graph Theory. New York: Dover, pp. 32-40, 1985.
- Torsion Number
- Torsion Tensor
- Torus
- Torus Coloring
- Torus Cutting
- Torus Knot
- Total Angular Defect
- Total Curvature
- Total Differential
- Total Function
- Total Intersection Theorem
- Total Order
- Total Space
- Totative
- Totient Function
- Totient Function Constants
- Totient Valence Function
- Touchard's Congruence
- Tour
- Tournament
- Tournament Matrix
- Tower of Power
- Towers of Hanoi
- T-Polyomino
- T-Puzzle