L(3,2,1)-labelings of three classes of 4-valent circulants
Combinatorics
2026-05-13 v2
Abstract
An -labeling of a graph is an assignment of nonnegative integers to vertices such that for every pair of vertices of , where denotes the distance between and in . The minimum span (i.e., the difference between the largest and the smallest value) among all -labelings of is denoted by . In this paper, we study -labelings of three classes of circulant graphs. Namely, we investigate of circulant graphs , where and is the order of the graph. This paper is a continuation of a recent publications of V. Bianco and T. Calamoneri who studied the square of cycles, i.e., circulant graphs .
Cite
@article{arxiv.2601.12574,
title = {L(3,2,1)-labelings of three classes of 4-valent circulants},
author = {Přemysl Holub and Martin Kopřiva},
journal= {arXiv preprint arXiv:2601.12574},
year = {2026}
}