On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice

DOI10.1016/j.endm.2015.05.042zbMath1347.05210OpenAlexW805424228MaRDI QIDQ324981

Sagnik Sen, Sandip Das, Soumen Nandi, Sasthi C. Ghosh

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.042

zbMATH Keywords

triangular latticeapproximation ratio\(L(k, k - 1, \ldots, 1)\) labeling spanassignment algorithmdistance \(k\)-clique

Mathematics Subject Classification ID

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

Related Items (2)

A lower bound technique for radio \(k\)-coloring ⋮ On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs

Cites Work

• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• \(L(h,1)\)-labeling subclasses of planar graphs
• The \(L(2,1)\)-labeling of unigraphs
• Labelling Graphs with a Condition at Distance 2
• Channel assignment and weighted coloring

This page was built for publication: On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice