The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs

DOI10.1016/j.aml.2011.03.028zbMath1218.05167OpenAlexW79397878WikidataQ123231747 ScholiaQ123231747MaRDI QIDQ548395

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

Publication date: 28 June 2011

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

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

zbMATH Keywords

frequency assignment\(L(2,1)\)-labelingtotal graph\(\Delta^2\)-conjecture

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 ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(L(2,1)\)-labeling on planar graphs
• On \((d,1)\)-total numbers of graphs
• \(T\)-colorings of graphs: recent results and open problems
• Parallel concepts in graph theory
• No-hole \(L(2,1)\)-colorings
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• 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: The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs