The minimum span of L(2,1)-labelings of certain generalized Petersen graphs Original Research Article

In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph Article Outline 1. Introduction 2. Meeting the general lower bound on the λ-number of GPGs 3. Exact λ-numbers for GPGs of order 5, 7, 8 4. A subclass of GPGs: the n-stars 5. Conclusions Acknowledgment References