Radio k-labelings for Cartesian products of graphs
Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 1, pp. 165-178
Voir la notice de l'article provenant de la source Library of Science
Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that
Keywords:
graph theory, radio channel assignment, radio k-labeling, Cartesian product, radio number, antipodal number
@article{DMGT_2008_28_1_a11,
author = {Kchikech, Mustapha and Khennoufa, Riadh and Togni, Olivier},
title = {Radio k-labelings for {Cartesian} products of graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {165--178},
publisher = {mathdoc},
volume = {28},
number = {1},
year = {2008},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a11/}
}
TY - JOUR AU - Kchikech, Mustapha AU - Khennoufa, Riadh AU - Togni, Olivier TI - Radio k-labelings for Cartesian products of graphs JO - Discussiones Mathematicae. Graph Theory PY - 2008 SP - 165 EP - 178 VL - 28 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a11/ LA - en ID - DMGT_2008_28_1_a11 ER -
Kchikech, Mustapha; Khennoufa, Riadh; Togni, Olivier. Radio k-labelings for Cartesian products of graphs. Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 1, pp. 165-178. http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a11/