Optimal L(d,1)-Labeling of Certain Direct Graph Bundles Cycles over Cycles and Cartesian Graph Bundles Cycles over CyclesHrastnik Ladinek, Irena (Avtor) L(d1)-labelingλ d 1 -numberdirect product of graphdirect graph bundleCartesian product of graphCartesian graph bundlecyclic ℓ-shiftchannel assignmentAn L(d,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 d and the labels on vertices at distance two differ by at least one, where d≥1. The span of f is the difference between the largest and the smallest numbers in f(V). The λ1d-number of G, denoted by λ1d(G), is the minimum span over all L(d,1)-labelings of G. We prove that λ1d(X)≤2d+2, with equality if 1≤d≤4, for direct graph bundle X=Cm×σℓCn and Cartesian graph bundle X=Cm□σℓCn, if certain conditions are imposed on the lengths of the cycles and on the cyclic ℓ-shift σℓ. MDPI AG20242025-03-13 11:09:04Članek v reviji92050sl© 2024 by the author