The \(L(2,1)\)-labeling on planar graphs

DOI10.1016/j.aml.2006.02.033zbMath1114.05091OpenAlexW2076299112MaRDI QIDQ868019

Zhendong Shao, Roger K.-C. Yeh

Publication date: 19 February 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.033

zbMATH Keywords

channel assignmentdistance two graph labeling

Mathematics Subject Classification ID

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

Related Items (8)

Facial \(L(2, 1)\)-edge-labelings of trees ⋮ \(L(2,1)\)-labelings on the modular product of two graphs ⋮ \(L(p,q)\)-labeling of a graph embeddable on the torus ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(L(d,1)\)-labelings of graphs
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• 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 \(L(2,1)\)-labeling on planar graphs