English

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

Combinatorics 2024-12-02 v1

Abstract

An L(2,1)L(2,1)-labeling of a graph G=(V,E)G=(V,E) is a function ff from the vertex set V(G)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 ff is the difference between the largest and the smallest numbers of f(V)f(V). The λ\lambda-number of GG, denoted by λ(G)\lambda (G), is the minimum span over all L(2,1)L(2,1)-labelings of GG. We prove that if X=CmσCnX= C_m\boxtimes^{\sigma_\ell} C_{n} is a direct graph bundle with fiber CnC_{n} and base CmC_m, nn is a multiple of 11 and \ell has a form of =[11k+(1)a4m]modn\ell =[11k+(-1)^a 4m]\mod n or of =[11k+(1)a3m]modn\ell =[11k+(-1)^a 3m]\mod n, where a{1,2}a\in \{1,2\} and k\ZZk\in \ZZ, then λ(X)=10\lambda (X)=10.

Keywords

Cite

@article{arxiv.2411.18992,
  title  = {Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles},
  author = {Irena Hrastnik Ladinek},
  journal= {arXiv preprint arXiv:2411.18992},
  year   = {2024}
}

Comments

arXiv admin note: text overlap with arXiv:2409.01285