Distance three labellings for K-n x K-2
- Authors
- Kim, Byeong Moon; Song, Byung Chul; Hwang, Woonjae
- Issue Date
- 1-5월-2013
- Publisher
- TAYLOR & FRANCIS LTD
- Keywords
- distance three labelling; radio number; direct products; complete graphs; channel assignment; 05C78; 05C51; 68A10
- Citation
- INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, v.90, no.5, pp.906 - 911
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
- Volume
- 90
- Number
- 5
- Start Page
- 906
- End Page
- 911
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/103257
- DOI
- 10.1080/00207160.2012.748896
- ISSN
- 0020-7160
- Abstract
- In a wireless communication network, the channel assignment problem addresses the correct assignment of a frequency to each transmitter in the network. To avoid interference between two nearby transmitters, the assigned frequencies must satisfy certain conditions related to the distance between transmitters. We can use only a limited number of channels; hence, we have to minimize the range of frequencies used. The distance labelling of a graph is a mathematical model of the channel assignment problem derived from the work of Hale [Frequency assignment: Theory and application, Proc. IEEE 68 (1980), pp. 1497-1514]. Lam et al. [L(j, k)-labelings for the products of complete graphs, J. Comb. Optim. 14 (2007), pp. 219-227] addressed distance two labelling for the direct product K(n)xK(m) of complete graphs K-n and K-m. In this paper, we solve the distance three labelling problem for K(n)xK(2).
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science and Technology > Data Computational Sciences in Division of Applied Mathematical Sciences > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.