The \(L(2,1)\)-labeling on the skew and converse skew products of graphs

DOI10.1016/j.aml.2006.02.032zbMath1129.05044OpenAlexW1979905985WikidataQ57811106 ScholiaQ57811106MaRDI QIDQ2463926

Yanyan Li

Publication date: 6 December 2007

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2006.02.032

zbMATH Keywords

channel assignmentskew product\(L(21)\)-labelingconverse skew product

Mathematics Subject Classification ID

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

Related Items (2)

\(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
• Relating path coverings to vertex labellings with a condition at distance two
• On \(L(d,1)\)-labelings of graphs
• On \(L(2,1)\)-labelings of Cartesian products of paths and 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
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: The \(L(2,1)\)-labeling on the skew and converse skew products of graphs