\(L(2,1)\)-labelings on the composition of \(n\) graphs

DOI10.1016/j.tcs.2010.03.013zbMath1195.05073MaRDI QIDQ986562

Zhendong Shao, Roberto Solis-Oba

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.013

zbMATH Keywords

channel assignment; \(L(2,1)\)-labeling; graph composition

Mathematics Subject Classification ID

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

Related Items

L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs, \(L(2,1)\)-labelings on the modular product of two graphs, \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs, New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs, \(L(j, k)\)-number of direct product of path and cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• Relating path coverings to vertex labellings with a condition at distance two
• On \(L(d,1)\)-labelings of graphs
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• The L(2,1)-labeling and operations of graphs
• The $L(2,1)$-Labeling Problem on Graphs