Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures

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

Sasthi C. Ghosh, Subhasis Koley

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

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

Uses Software

• CALMA

Cites Work

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

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