| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513000 | Discrete Mathematics | 2005 | 10 Pages |
Abstract
The irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of the vertices are distinct. In this paper we study the irregularity strength of circulant graphs of degree 4. We find the exact value of the strength for a large family of circulant graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
J.-L. Baril, H. Kheddouci, O. Togni,