Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles
Combinatorics
2024-12-02 v1
Abstract
An -labeling of a graph is a function from the vertex set 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 is the difference between the largest and the smallest numbers of . The -number of , denoted by , is the minimum span over all -labelings of . We prove that if is a direct graph bundle with fiber and base , is a multiple of 11 and has a form of or of , where and , then .
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