Deriving bounds on L(k₁,k₂) labeling of triangular lattice by exploring underlined graph structures

DOI10.1007/978-981-16-6890-6_44OpenAlexW4226060254MaRDI QIDQ2079984FDOQ2079984

Authors: Subhasis Koley, Sasthi C. Ghosh 

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_44

zbMATH Keywords

span\(L(k_1,k_2)\) labelinginfinite triangular grid

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• A survey on labeling graphs with a condition at distance two
• Graph labeling and radio channel assignment
• Optimal \(L(h,k)\)-labeling of regular grids
• \(L(2,1)\)-labeling of interval graphs
• Models and solution techniques for frequency assignment problems
• Graph labellings with variable weights, a survey
• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• Real Number Channel Assignments for Lattices

Cited In (1)

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

Uses Software

• CALMA

This page was built for publication: Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures

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