Triangular Graph
The triangular graph with 
nodes on a side is denoted 
. Tutte (1970) showed that the ChromaticPolynomials of planar triangular graphs possess a Root close to 
,where 
is the Golden Mean. More precisely, if is the number of Vertices of 
, then
(Le Lionnais 1983, p. 46). Every planar triangular graph possesses a Vertex of degree 3, 4, or 5 (Le Lionnais 1983,pp. 49 and 53).See also Lattice Graph
References
Le Lionnais, F. Les nombres remarquables. Paris: Hermann, 1983. Tutte, W. T. ``On Chromatic Polynomials and the Golden Ratio.'' J. Combin. Theory 9, 289-296, 1970.
- 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
- Topological Completion
- Topological Dimension
- Topological Entropy
- Topological Groupoid
- Topologically Conjugate
- Topologically Transitive