English

Irregular Labellings of Circulant Graphs

Combinatorics 2011-11-03 v1

Abstract

We investigate the \textit{irregularity strength} (s(G)s(G)) and \textit{total vertex irregularity strength} (tvs(G)tvs(G)) of circulant graphs Cin(1,2,...,k)Ci_n(1,2,...,k) and prove that tvs(Cin(1,2,...,k))=n+2k2k+1tvs(Ci_n(1,2,...,k))=\lceil\frac{n+2k}{2k+1}\rceil, while s(Cin(1,2,...,k))=n+2k12ks(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil except the case when (nmod4k=2k+1kmod2=1)n=2k+1(n \bmod 4k = 2k+1 \wedge k\bmod 2=1) \vee n=2k+1 and s(Cin(1,2,...,k))=n+2k12k+1s(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil+1.

Cite

@article{arxiv.1111.0316,
  title  = {Irregular Labellings of Circulant Graphs},
  author = {Marcin Anholcer},
  journal= {arXiv preprint arXiv:1111.0316},
  year   = {2011}
}

Comments

I already had submitted this paper when Cory Palmer suggested that the main proofs may be simplified. Our common paper is still in preparation (to appear in Discrete Mathematics, we hope). However, I decided to publish the original version here, as some ideas included in it are supposed to be used in my further works. On the other hand, maybe someone else would like to use it

R2 v1 2026-06-21T19:29:19.624Z