L(3,2,1)-labeling for cylindrical grid: the Cartesian product of a path and a cycle

DOI10.11568/KJM.2017.25.2.279zbMATH Open1462.05316OpenAlexW2733115740MaRDI QIDQ5208539FDOQ5208539

Authors: Byeong Moon Kim, Woonjae Hwang, Byung Chul Song 

Publication date: 8 January 2020

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

Recommendations

• \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
• \(L(3,2,1)\)-labeling of graphs
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On \(L(d,1)\)-labelings of the Cartesian product of two cycles.
• The \(L(3,2,1)\)-labeling number of the Cartesian product of a complete graph and a cycle.

zbMATH Keywords

graph labeling\(L(3,2,1)\)-labelingCartesian products

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• \(L(3,2,1)\)-labeling of triangular and toroidal grids

This page was built for publication: \(L(3,2,1)\)-labeling for cylindrical grid: the Cartesian product of a path and a cycle

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