\(T\)-colorings and \(T\)-edge spans of graphs (Q1808715)

To formulate the channel assignment problem graph-theoretically, we construct a graph \(G\) such that \(V(G)= \{x_1, x_2,\dots, x_n\}\) and there is an edge between transmitters \(x_i\) and \(x_j\) iff they interfere. Let \(T\) be a set of nonnegative integers that contains \(0\). A \(T\)-colouring of \(G\) is an assignment of a nonnegative integer \(f(x)\) (a frequency) to each vertex \(x\) of \(G\) such that \(|f(x)- f(y)|\not\in T\) whenever \(xy\in E(G)\). In case \(T= \{0\}\), the \(T\)-colouring is the common vertex colouring. The \(T\)-edge span of powers of the \(n\)-cycle for \(T= \{0,1,\dots, k-1\}\) is also considered.