L(P, Q)-Label Coloring Problem With Application To Channel Allocation

In this paper, the L,(p,q-coloring problem of the graph is studied with application to channel allocation of the wireless network. First, by introducing two new logical operators, some necessary and sufficient conditions for solving the L(p,q-coloring problem are given. Moreover, it is noted that all solutions of the obtained logical equations are corresponding to each coloring scheme. Second, by using the semitensor product, the necessary and sufficient conditions are converted to an algebraic form. Based on this, all coloring schemes can be obtained through searching all column indices of the zero columns. Finally, the obtained result is applied to analyze channel allocation of the wireless network. Furthermore, an illustration example is given to show the effectiveness of the obtained results in this paper.