Linear and cyclic radio k-labelings of trees
Mustapha Kchikech, Riadh Khennoufa, Olivier Togni (2007)
Discussiones Mathematicae Graph Theory
Similarity:
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 , for any two distinct vertices x and y, where is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling....