Optimal L(2,1)-labeling of certain strong graph bundles cycles over cycles

2024/11/28 by Irena Hrastnik Ladinek, Ladinek, Irena Hrastnik
Computer Science · #Graph Labeling and Dimension Problems #Coding theory and cryptography

paper · pdf · doi:10.48550/arxiv.2411.18992

Abstract

An L(2,1)-labeling of a graph G=(V,E) is a function f from the vertex set V(G) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two, and the labels on vertices at distance two differ by at least one. The span of f is the difference between the largest and the smallest numbers of f(V). The λ-number of G, denoted by λ(G), is the minimum span over all L(2,1)-labelings of G. We prove that if X= C_m\boxtimes^σ_ℓ C_n is a direct graph bundle with fiber C_n and base C_m, n is a multiple of 11 and ℓ has a form of ℓ =[11k+(-1)^a 4m]\mod n or of ℓ =[11k+(-1)^a 3m]\mod n, where a∈ \1,2\ and k∈ \ZZ, then λ(X)=10.

Related

• Optimal L(d,1)-labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles
• Distance two labeling of direct product of paths and cycles
• On L(2,1)-labelings of some products of oriented cycles
• Graph Labeling with Distance Conditions and the Delta Squared Conjecture
• The L(2, 1)-Labeling Problem on Oriented Regular Grids