Optimal L(j,k)-Edge-Labeling of Regular Grids

DOI10.1142/S012905411550029XzbMath1328.05161MaRDI QIDQ2947806

Tiziana Calamoneri

Publication date: 29 September 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

channel assignment problem\(L(j,k)\)-labelingtriangular gridshexagonal grids\(L(j,k)\)-edge-labelingsquared grids

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph ⋮ Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids

Cites Work

• Distance two edge labelings of lattices
• A survey on labeling graphs with a condition at distance two

This page was built for publication: Optimal L(j,k)-Edge-Labeling of Regular Grids