$L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle

DOI10.11568/kjm.2017.25.2.279zbMath1462.05316OpenAlexW2733115740MaRDI QIDQ5208539

Byeong Moon Kim, Byung Chul Song, Woonjae Hwang

Publication date: 8 January 2020

Full work available at URL: http://journal.kkms.org/index.php/kjm/article/download/499/369

zbMATH Keywords

Cartesian productsgraph labeling\(L(3,2,1)\)-labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• \(L(3,2,1)\)-labeling of graphs
• A distance-labelling problem for hypercubes
• Distance three labelings for direct products of three complete graphs
• A survey on labeling graphs with a condition at distance two
• Distance three labellings for K _n ×K ₂
• Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs