A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)

DOI10.1016/J.DAM.2022.08.030zbMath1498.05234OpenAlexW4296269347WikidataQ114191364 ScholiaQ114191364MaRDI QIDQ2081493

Qingjie Ye

Publication date: 13 October 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.08.030

zbMATH Keywords

channel assignment1)\)-labelling\(L (2

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• No-hole \(L(2,1)\)-colorings
• An extremal problem on non-full colorable graphs
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)