Distance three labellings for K-n x K-2

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

2

초록

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).

키워드

distance three labelling; radio number; direct products; complete graphs; channel assignment; 05C78; 05C51; 68A10; RADIO NUMBER; K)-LABELING PROBLEM; ASSIGNMENT; PRODUCTS; GRAPHS; L(H
제목
Distance three labellings for K-n x K-2
저자
Kim, Byeong Moon; Song, Byung Chul; Hwang, Woonjae
DOI
10.1080/00207160.2012.748896
발행일
2013-05-01
유형
Article
저널명
International Journal of Computer Mathematics
권
90
호
5
페이지
906 ~ 911