Vertex Degree
The degree of a Vertex of a Graph is the number ofEdges which touch the Vertex, also called the Local Degree. TheVertex degree of a point 
in a Graph, denoted 
,satisfies
where
is the total number of Edges. Directed Graphs have two typesof degrees, known as the Indegree and the Outdegree.See also Directed Graph, Indegree, Local Degree, Outdegree- Thue Constant
- Thue-Morse Constant
- Thue-Morse Sequence
- Thue Sequence
- Thue-Siegel-Roth Theorem
- Thue-Siegel-Schneider-Roth Theorem
- Thue's Theorem
- Thurston's Geometrization Conjecture
- Thwaites Conjecture
- Ticktacktoe
- Tic-Tac-Toe
- Tight Closure
- Tightly Embedded
- Tiling
- Tiling Theorem
- Times
- Titanic Prime
- Titchmarsh Theorem
- Tit-for-Tat
- Tits Group
- Toeplitz Matrix
- Togliatti Surface
- Tomography
- Tooth Surface
- Topological Basis