Přejít k obsahu

Radio Labelings of Distance Graphs

HOLUB, P. Radio Labelings of Distance Graphs. Ilmenau, Německo, 2012.
Jazyk publikace: eng
Anglický název: Radio Labelings of Distance Graphs
Rok vydání: 2012
Autoři: RNDr. Přemysl Holub Ph.D.
Abstrakt EN: Frequency planning consists of 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 |f(x)-f(y)| > k - dist(x,y), for any two vertices x and y. The radio k-labeling number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this talk, an overview of some known results is presented and some upper and lower bounds on radio k-labeling number of distance graphs is shown.
Klíčová slova