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

DOI10.1016/j.tcs.2011.01.031zbMath1223.05261OpenAlexW1991686016MaRDI QIDQ533885

Cuiqi Wang, Ziming Duan, Pingli Lv, Lian-Ying Miao, Zheng-Ke Miao

Publication date: 10 May 2011

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

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

zbMATH Keywords

skew productfrequency assignment\(L(2,1)\)-labelingconverse skew product

Mathematics Subject Classification ID

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

Related Items (1)

Total coloring conjecture on certain classes of product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• The \(L(2,1)\)-labeling on planar graphs
• Improved 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
• On \((d,1)\)-total numbers of graphs
• \(T\)-colorings of graphs: recent results and open problems
• On the \(L(p,1)\)-labelling of graphs
• The \(L(2,1)\)-labelling of trees
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• The L(2,1)-labeling and operations of graphs
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs