Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs

DOI10.1016/j.tcs.2008.02.048zbMath1145.68040OpenAlexW2083420236WikidataQ57810773 ScholiaQ57810773MaRDI QIDQ930929

Elsie Sterbin Gottlieb

Publication date: 24 June 2008

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

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

zbMATH Keywords

channel assignment\(L\)(2,1)-labelinggraph converse skew productgraph skew product

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

\(L(2,1)\)-labelings on the modular product of two graphs ⋮ Total coloring conjecture on certain classes of product graphs ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ \(L(2,1)\)-labelings on the composition of \(n\) graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• Relating path coverings to vertex labellings with a condition at distance two
• On \(L(d,1)\)-labelings of graphs
• Distance-two labelings of graphs
• The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
• 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