- Label Coloring Problem with Application to Channel Allocation

Zhenbin Liu and Yuqiang Wu

Mathematical Problems in Engineering, 2020, vol. 2020, 1-8

Abstract:

In this paper, the - 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 - 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5369859.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5369859.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5369859

DOI: 10.1155/2020/5369859

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().