In graph theory, a T-Coloring of a graph G = ( V , E ) {\displaystyle G=(V,E)} , given the set T of nonnegative integers containing 0, is a function c : V ( G ) → N {\displaystyle c:V(G)\to \mathbb {N} } that maps each vertex to a positive integer (color) such that if u and w are adjacent then | c ( u ) − c ( w ) | ∉ T {\displaystyle |c(u)-c(w)|\notin T} . In simple words, the absolute value of the difference between two colors of adjacent vertices must not belong to fixed set T. The concept was introduced by William K. Hale. If T = {0} it reduces to common vertex coloring. The T-chromatic number, χ T ( G ) , {\displaystyle \chi _{T}(G),} is the minimum number of colors that can be used in a T-coloring of G. The complementary coloring of T-coloring c, denoted c ¯ {\displaystyle {\overline {c}}} is defined for each vertex v of G by
c ¯ ( v ) = s + 1 − c ( v ) {\displaystyle {\overline {c}}(v)=s+1-c(v)}
where s is the largest color assigned to a vertex of G by the c function.
Relation to chromatic number Proposition. χ T ( G ) = χ ( G ) {\displaystyle \chi _{T}(G)=\chi (G)} . Proof. Every T-coloring of G is also a vertex coloring of G, so χ T ( G ) ≥ χ ( G ) . {\displaystyle \chi _{T}(G)\geq \chi (G).} Suppose that χ ( G ) = k {\displaystyle \chi (G)=k} and r = max ( T ) . {\displaystyle r=\max(T).} Given a common vertex k-coloring function c : V ( G ) → N {\displaystyle c:V(G)\to \mathbb {N} } using the colors { 1 , … , k } . {\displaystyle \{1,\ldots ,k\}.} We define d : V ( G ) → N {\displaystyle d:V(G)\to \mathbb {N} } as
d ( v ) = ( r + 1 ) c ( v ) {\displaystyle d(v)=(r+1)c(v)}
For every two adjacent vertices u and w of G,
| d ( u ) − d ( w ) | = | ( r + 1 ) c ( u ) − ( r + 1 ) c ( w ) | = ( r + 1 ) | c ( u ) − c ( w ) | ≥ r + 1 {\displaystyle |d(u)-d(w)|=|(r+1)c(u)-(r+1)c(w)|=(r+1)|c(u)-c(w)|\geq r+1}
so | d ( u ) − d ( w ) | ∉ T . {\displaystyle |d(u)-d(w)|\notin T.} Therefore d is a T-coloring of G. Since d uses k colors, χ T ( G ) ≤ k = χ ( G ) . {\displaystyle \chi _{T}(G)\leq k=\chi (G).} Consequently, χ T ( G ) = χ ( G ) . {\displaystyle \chi _{T}(G)=\chi (G).}
T-span The span of a T-coloring c of G is defined as
s p T ( c ) = max u , w ∈ V ( G ) | c ( u ) − c ( w ) | . {\displaystyle sp_{T}(c)=\max _{u,w\in V(G)}|c(u)-c(w)|.}
The T-span is defined as:
s p T ( G ) = min c s p T ( c ) . {\displaystyle sp_{T}(G)=\min _{c}sp_{T}(c).}
Some bounds of the T-span are given below:
… excerpt ends here. Continue reading the full article.


