Labeling crossed prisms with a condition at distance two

DOI10.2140/involve.2018.11.67zbMath1369.05064OpenAlexW2737057446MaRDI QIDQ2398942

Jessica Oehrlein, Matthew Beaudouin-Lafon, Denise Sakai Troxell, Serena H. Chen, Nathaniel J. Karst

Publication date: 21 August 2017

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2018.11.67

zbMATH Keywords

channel assignmentgeneralized Petersen graph\(L(2,1)\)-labeling\(L(2,1)\)-coloringdistance two labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On generalized Petersen graphs labeled with a condition at distance two
• On \(L(2,1)\)-labeling of generalized Petersen graphs
• The \(\Delta^2\) conjecture holds for graphs of small order
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• Griggs and Yeh's Conjecture and $L(p,1)$-labelings
• Labelling Graphs with a Condition at Distance 2
• On Regular Graphs Optimally Labeled with a Condition at Distance Two
• An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs

This page was built for publication: Labeling crossed prisms with a condition at distance two