Irregular Labellings of Circulant Graphs

preprint2011arXivOpen access

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+1⌉tvs(Ci_n(1,2,...,k))=\lceil\frac{n+2k}{2k+1}\rceil, while s(Cin(1,2,...,k))=⌈n+2k−12k⌉s(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil except the case when (n mod 4k=2k+1∧k mod 2=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+2k−12k⌉+1s(Ci_n(1,2,...,k))=\lceil\frac{n+2k-1}{2k}\rceil+1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.