On \(L(2,1)\)-labeling of generalized Petersen graphs

DOI10.1007/s10878-011-9380-8zbMath1261.90075OpenAlexW1974517402MaRDI QIDQ1928525

Liang-Hao Huang, Hong-Gwa Yeh, Chun-Ying Chiang, Yuan-Zhen Huang

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9380-8

zbMATH Keywords

channel assignmentgeneralized Petersen graphfrequency allocation\(L(2,1)\)-labeling\(\lambda\)-numberinterchannel interference3-regular graph\(L(2,1)\)-labeling number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (6)

\(L(2, 1)\)-labeling of circulant graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ Labeling crossed prisms with a condition at distance two ⋮ Unnamed Item ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus

Cites Work

• Unnamed Item
• On generalized Petersen graphs labeled with a condition at distance two
• \(L(h,1)\)-labeling subclasses of planar graphs
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: On \(L(2,1)\)-labeling of generalized Petersen graphs