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

Abstract

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 G to the non-negative integers such that | f ( x ) – f ( y ) | ⩾ 2 if xand y are adjacent vertices and | f ( x ) – f ( y ) | ⩾ 1 if xand y are at distance two. The goal is to determine the λ -number of G , which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from { 0 , 1 , … , k } . Recent work has focused on determining the λ -number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ -numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ -number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ -number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ -number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results.