\(L(1, 2)\)-edge-labelings for lattices

DOI10.1007/s11766-014-3176-4zbMath1313.05318OpenAlexW1983164350MaRDI QIDQ2514965

Dan He, Wensong Lin

Publication date: 11 February 2015

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-014-3176-4

zbMATH Keywords

line graphtriangular latticesquare latticehexagonal lattice\(L(j, k)\)-edge-labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Facial \(L(2, 1)\)-edge-labelings of trees, Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L(h,1)\)-labeling subclasses of planar graphs
• Distance two edge labelings of lattices
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• A survey on labeling graphs with a condition at distance two
• Real Number Channel Assignments for Lattices
• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Approximations for  -Colorings of Graphs
• Graph distance‐dependent labeling related to code assignment in computer networks
• Labeling trees with a condition at distance two