Irregular Labellings of Circulant Graphs
Abstract
We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1,2,...,k) and prove that tvs(Cin(1,2,...,k))=n+2k2k+1, while s(Cin(1,2,...,k))=n+2k-12k except the case when (n 4k = 2k+1 k 2=1) n=2k+1 and s(Cin(1,2,...,k))=n+2k-12k+1.
0