Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648080 | Discrete Mathematics | 2012 | 6 Pages |
Abstract
We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1,2,…,k)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 if either n=2k+1n=2k+1 or if kk is odd and n≡2k+1(mod4k), then s(Cin(1,2,…,k))=⌈n+2k−12k⌉+1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Marcin Anholcer, Cory Palmer,