On \(L(2,1)\)-labelings of some products of oriented cycles

DOI10.3934/mfc.2021029zbMath1497.05236arXiv1912.00457OpenAlexW3213888240MaRDI QIDQ2144165

Lucas Colucci, Ervin Gyoeri

Publication date: 1 June 2022

Published in: Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00457

zbMATH Keywords

oriented graphsgraph productsCartesian product of graphsstrong product of graphs\(L(2, 1)\)-labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• A survey on labeling graphs with a condition at distance two
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles