Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids

DOI10.1016/j.ipl.2013.03.003zbMath1358.05243OpenAlexW49701365MaRDI QIDQ396591

Tiziana Calamoneri

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.003

zbMATH Keywords

combinatorial problemsinterconnection networkschannel assignment problemtriangular grids\(L(2,1,1)\)-labeling\(L(3,2,1)\)-labelingeight-regular grids (ERGs)

Mathematics Subject Classification ID

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

Related Items (8)

\(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice ⋮ \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle ⋮ Optimal \(L(3, 2, 1)\)-labeling of triangular lattice

Uses Software

• CALMA

Cites Work

• Distance three labelings of trees
• \(L(3,2,1)\)-labeling of graphs
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Models and solution techniques for frequency assignment problems
• Unnamed Item

This page was built for publication: Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids