6533b828fe1ef96bd1288f94

RESEARCH PRODUCT

The irregularity strength of circulant graphs

Olivier TogniJean-luc BarilHamamache Kheddouci

subject

CombinatoricsDiscrete mathematicsCirculant graphSimple graphIntegerLabelingDiscrete Mathematics and CombinatoricsCirculant matrixIrregularity strengthGraphTheoretical Computer ScienceMathematics

description

AbstractThe 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.

yearjournalcountryeditionlanguage
2005-11-01Discrete Mathematics
10.1016/j.disc.2005.09.006http://dx.doi.org/10.1016/j.disc.2005.09.006