T-coloring

In graph theory, a T-Coloring of a graph ${\displaystyle G=(V,E)}$, given the set T of nonnegative integers containing 0, is a function ${\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 ${\displaystyle |c(u)-c(w)|\notin T}$.[1] 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.[2] If T = {0} it reduces to common vertex coloring.

Two T -colorings of a graph for T = {0, 1, 4}

The T-chromatic number, ${\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 ${\displaystyle {\overline {c}}}$ is defined for each vertex v of G by

${\displaystyle {\overline {c}}(v)=s+1-c(v)}$

where s is the largest color assigned to a vertex of G by the c function.[1]

Relation to Chromatic Number

Proposition. ${\displaystyle \chi _{T}(G)=\chi (G)}$.[3]

Proof. Every T-coloring of G is also a vertex coloring of G, so ${\displaystyle \chi _{T}(G)\geq \chi (G).}$ Suppose that ${\displaystyle \chi (G)=k}$ and ${\displaystyle r=\max(T).}$ Given a common vertex k-coloring function ${\displaystyle c:V(G)\to \mathbb {N} }$ using the colors ${\displaystyle \{1,\ldots ,k\}.}$ We define ${\displaystyle d:V(G)\to \mathbb {N} }$ as

${\displaystyle d(v)=(r+1)c(v)}$

For every two adjacent vertices u and w of G,

${\displaystyle |d(u)-d(w)|=|(r+1)c(u)-(r+1)c(w)|=(r+1)|c(u)-c(w)|\geq r+1}$

so ${\displaystyle |d(u)-d(w)|\notin T.}$ Therefore d is a T-coloring of G. Since d uses k colors, ${\displaystyle \chi _{T}(G)\leq k=\chi (G).}$ Consequently, ${\displaystyle \chi _{T}(G)=\chi (G).}$

T-span

The span of a T-coloring c of G is defined as

${\displaystyle sp_{T}(c)=\max _{u,w\in V(G)}|c(u)-c(w)|.}$

The T-span is defined as:

${\displaystyle sp_{T}(G)=\min _{c}sp_{T}(c).}$[4]

Some bounds of the T-span are given below:

• For every k-chromatic graph G with clique of size ${\displaystyle \omega }$ and every finite set T of nonnegative integers containing 0, ${\displaystyle sp_{T}(K_{\omega })\leq sp_{T}(G)\leq sp_{T}(K_{k}).}$

• For every graph G and every finite set T of nonnegative integers containing 0 whose largest element is r, ${\displaystyle sp_{T}(G)\leq (\chi (G)-1)(r+1).}$[5]

• For every graph G and every finite set T of nonnegative integers containing 0 whose cardinality is t, ${\displaystyle sp_{T}(G)\leq (\chi (G)-1)t.}$ [5]

See also

• Graph coloring

References

1. Chartrand, Gary; Zhang, Ping (2009). "14. Colorings, Distance, and Domination". Chromatic Graph Theory. CRC Press. pp. 397–402.
2. W. K. Hale, Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497–1514.
3. M. B. Cozzens and F. S. Roberts, T -colorings of graphs and the Channel Assignment Problem. Congr. Numer. 35 (1982) 191–208.
4. Chartrand, Gary; Zhang, Ping (2009). "14. Colorings, Distance, and Domination". Chromatic Graph Theory. CRC Press. p. 399.
5. M. B. Cozzens and F. S. Roberts, T -colorings of graphs and the Channel Assignment Problem. Congr. Numer. 35 (1982) 191–208.