An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs

DOI10.1109/TCSI.2005.862184MaRDI QIDQ4590490zbMATH OpenFDO

Authors Sarah Spence Adams, Jonathan Cass, Denise Sakai Troxell

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited in

(7)

• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
• On \(L(2,1)\)-labeling of generalized Petersen graphs
• Labeling crossed prisms with a condition at distance two
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• Labeling matched sums with a condition at distance two
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
• On irreducible no‐hole L(2, 1)‐coloring of trees

This page was built for publication: An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4590490)