Irregularity strength of circulant graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2005

Irregularity strength of circulant graphs

Résumé

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.

Dates et versions

hal-00188406 , version 1 (16-11-2007)

Identifiants

Citer

Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni. Irregularity strength of circulant graphs. Discrete Mathematics, 2005, 304 (1-3), pp.1-10. ⟨10.1016/j.disc.2005.09.006⟩. ⟨hal-00188406⟩
404 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More