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

2019/12/01 by Colucci, Lucas, Győri, Ervin
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1912.00457

Abstract

We refine two results of Jiang, Shao and Vesel on the L(2,1)-labeling number λ of the Cartesian and the strong product of two oriented cycles. For the Cartesian product, we compute the exact value of λ(\overrightarrowC_m \square \overrightarrowC_n) for m, n ≥ 40; in the case of strong product, we either compute the exact value or establish a gap of size one for λ(\overrightarrowC_m \boxtimes \overrightarrowC_n) for m, n ≥ 48.

Related

• Optimal L(2,1)-labeling of certain strong graph bundles cycles over cycles
• Distance two labeling of direct product of paths and cycles
• Optimal L(d,1)-labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles
• The L(2, 1)-Labeling Problem on Oriented Regular Grids
• Labeled Packing of Cycles and Circuits