A New Approach to the $L(2,1)$ -Labeling of Some Products of Graphs


The frequency assignment problem is to assign a frequency which is a nonnegative integer to each radio transmitter so that interfering transmitters are assigned frequencies whose separation is not in a set of disallowed separations. This frequency assignment problem can be modelled with vertex labelings of graphs. An L(2, 1)-labeling of a graph G is a… (More)
DOI: 10.1109/TCSII.2008.922450


3 Figures and Tables

Slides referencing similar topics