Linear and cyclic radio k-labelings of trees
Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 105-123
Voir la notice de l'article provenant de la source Library of Science
Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that
Keywords:
graph theory, radio channel assignment, cyclic and linear radio k-labeling
@article{DMGT_2007_27_1_a9,
author = {Kchikech, Mustapha and Khennoufa, Riadh and Togni, Olivier},
title = {Linear and cyclic radio k-labelings of trees},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {105--123},
publisher = {mathdoc},
volume = {27},
number = {1},
year = {2007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a9/}
}
TY - JOUR AU - Kchikech, Mustapha AU - Khennoufa, Riadh AU - Togni, Olivier TI - Linear and cyclic radio k-labelings of trees JO - Discussiones Mathematicae. Graph Theory PY - 2007 SP - 105 EP - 123 VL - 27 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a9/ LA - en ID - DMGT_2007_27_1_a9 ER -
Kchikech, Mustapha; Khennoufa, Riadh; Togni, Olivier. Linear and cyclic radio k-labelings of trees. Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 105-123. http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a9/