An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs
From MaRDI portal
Publication:4590490
DOI10.1109/TCSI.2005.862184zbMath1374.05187MaRDI QIDQ4590490
Sarah Spence Adams, Denise Sakai Troxell, Jonathan Cass
Publication date: 20 November 2017
Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (7)
The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ Labeling crossed prisms with a condition at distance two ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ Labeling matched sums with a condition at distance two ⋮ On irreducible no‐hole L(2, 1)‐coloring of trees ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
This page was built for publication: An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs