Optimal L(2,1)-labeling of certain strong graph bundles cycles over cycles
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= Cmσ Cn is a direct graph bundle with fiber Cn and base Cm, n is a multiple of 11 and has a form of =[11k+(-1)a 4m] n or of =[11k+(-1)a 3m] n, where a∈ \1,2\ and k∈ , then λ (X)=10.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.