Optimal \(L(3, 2, 1)\)-labeling of triangular lattice

DOI10.1016/j.dam.2016.12.014zbMath1365.05255OpenAlexW2579349182MaRDI QIDQ2357158

Soumen Nandi, Sandip Das, Sasthi C. Ghosh

Publication date: 19 June 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.014

zbMATH Keywords

channel assignmenttriangular lattice\(L(3, 2, 1)\) labeling

Mathematics Subject Classification ID

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

Cites Work

• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• Channel assignment for interference avoidance in honeycomb wireless networks
• On \(L(d,1)\)-labelings of graphs
• \(L(h,1)\)-labeling subclasses of planar graphs
• The \(L(2,1)\)-labeling of unigraphs
• Real Number Graph Labellings with Distance Conditions
• Labelling Graphs with a Condition at Distance 2
• Distributed Online Frequency Assignment in Cellular Networks

This page was built for publication: Optimal \(L(3, 2, 1)\)-labeling of triangular lattice