arXiv:1111.0316 [math.CO]AbstractReferencesReviewsResources
Irregular Labellings of Circulant Graphs
Published 2011-11-01Version 1
We investigate the \textit{irregularity strength} ($s(G)$) and \textit{total vertex irregularity strength} ($tvs(G)$) of circulant graphs $Ci_n(1,2,...,k)$ and prove that $tvs(Ci_n(1,2,...,k))=\lceil\frac{n+2k}{2k+1}\rceil$, while $s(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil$ except the case when $(n \bmod 4k = 2k+1 \wedge k\bmod 2=1) \vee n=2k+1$ and $s(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil+1$.
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
Categories: math.CO
Subjects: 05C78
Related articles: Most relevant | Search more
arXiv:1803.07071 [math.CO] (Published 2018-03-18)
The degree-diameter problem for circulant graphs of degrees 10 and 11 - extended version
arXiv:2411.19197 [math.CO] (Published 2024-11-28)
Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
arXiv:1203.0707 [math.CO] (Published 2012-03-04)
Asymptotic Automorphism Groups of Circulant Graphs and Digraphs