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

DOI10.1016/J.ENDM.2015.05.042MaRDI QIDQ324981zbMATH OpenOpenAlexFDO

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

Publication date 17 October 2016

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

zbMATH Keywords

approximation ratiotriangular lattice\(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)

Recommendations

• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• Multiple \(L(j,1)\)-labeling of the triangular lattice
• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• \(L(3,2,1)\)-labeling of graphs
• \(L(3,2,1)\)-labelling of graphs

Cites work

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

Cited in

(9)

• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• Labelings of type (1, 1, 1) for Klein bottle fullerenes
• Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
• L(3,2,1)-labeling of triangular and toroidal grids
• On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
• scientific article; zbMATH DE number 5873444 (Why is no real title available?)
• Multiple \(L(j,1)\)-labeling of the triangular lattice
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• A lower bound technique for radio k-coloring

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324981)