Abstract
A variation of the classical channel assignment problem is to assign a radio channel which is a nonnegative integer to each radio transmitter so that “close” transmitters must receive different channels and “very close” transmitters must receive channels that are at least two channels apart. The goal is to minimize the span of a feasible assignment. This channel assignment problem can be modeled with distance-dependent graph labelings. A k-L(2,1)-labeling of a graph G is a mapping f from the vertex set of G to the set {0,1,2,…,k} such that |f(x)−f(y)|≥2 if d(x,y)=1 and \(f(x)\not =f(y)\) if d(x,y)=2, where d(x,y) is the distance between vertices x and y in G. The minimum k for which G admits an k-L(2,1)-labeling, denoted by λ(G), is called the λ-number of G. Very little is known about λ-numbers of 3-regular graphs. In this paper we focus on an important subclass of 3-regular graphs called generalized Petersen graphs. For an integer n≥3, a graph G is called a generalized Petersen graph of order n if and only if G is a 3-regular graph consisting of two disjoint cycles (called inner and outer cycles) of length n, where each vertex of the outer (resp. inner) cycle is adjacent to exactly one vertex of the inner (resp. outer) cycle. In 2002, Georges and Mauro conjectured that λ(G)≤7 for all generalized Petersen graphs G of order n≥7. Later, Adams, Cass and Troxell proved that Georges and Mauro’s conjecture is true for orders 7 and 8. In this paper it is shown that Georges and Mauro’s conjecture is true for generalized Petersen graphs of orders 9, 10, 11 and 12.
Similar content being viewed by others
References
Adams SS, Cass J, Troxell DS (2006) An extension of the channel-assignment problem: L(2,1)-labelings of generalized Petersen graphs. IEEE Trans Circuits Syst I, Fundam Theory Appl 53:1101–1107
Adams SS, Cass J, Tesch M, Troxell DS, Wheeland C (2007) The minimum span of L(2,1)-labelings of certain generalized Petersen graphs. Discrete Appl Math 155:1314–1325
Bondy JA, Murty USR (2008) Graph theory. Graduate texts in mathematics, vol 244. Springer, New York
Calamoneri T (2006) The L(h,k)-labeling problem: a survey and annotated bibliography. Comput J 49:585–608
Calamoneri T, Petreschi R (2004) L(h,1)-labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414–426
Chang GJ, Kuo D (1996) The L(2,1)-labeling on graphs. SIAM J Discrete Math 9:309–316
Georges JP, Mauro DW (2002) On generalized Petersen graphs labeled with a condition at distance two. Discrete Math 259:311–318
Gonçalves D (2008) On the L(p,1)-labelling of graphs. Discrete Math 308:1405–1414. Earlier version in EuroComb ’05
Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance two. SIAM J Discrete Math 5:586–595
Hale WK (1980) The Frequency assignment: theory and application. Proc IEEE 68:1497–1514
Havet F, Reed B, Sereni JS (2008) L(2,1)-labelling of graphs. In: Proceedings of the ACM-SIAM symposium on discrete algorithm (SODA 2008), January 2008
Kang JH (2008) L(2,1)-labelling for Hamiltonian graphs of maximum degree 3. SIAM J Discrete Math 22:213–230
Král D, Škrekovski R (2003) A theorem about channel assignment problem. SIAM J Discrete Math 16:426–437
Roberts FS, Working group agenda, DIMACS/DIMATIA/Renyi working group on graph colorings and their generalizations (2003), posted at http://dimacs.rutgers.edu/Workshops/GraphColor/main.html
Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discrete Math 306:1217–1231
Author information
Authors and Affiliations
Corresponding author
Additional information
L.-H. Huang was partially supported by National Science Council under grant NSC99-2811-M-008-059.
H.-G. Yeh was partially supported by National Science Council under grant NSC97-2628-M-008-018-MY3.
Rights and permissions
About this article
Cite this article
Huang, YZ., Chiang, CY., Huang, LH. et al. On L(2,1)-labeling of generalized Petersen graphs. J Comb Optim 24, 266–279 (2012). https://doi.org/10.1007/s10878-011-9380-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9380-8