An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength, s (G), is the maximal edge weight, minimized over all irregular assignments, and is set to infinity if no such assignment is possible. In this paper, we take an iterative approach to calculating the irregularity strength of a graph. In particular, we develop a new algorithm that determines the exact value s (T) for trees T in which every two vertices of degree not equal to two are at distance at least eight. © 2010 Elsevier B.V. All rights reserved.
Ferrara, M., Gould, R., Karoński, M., & Pfender, F. (2010). An iterative approach to graph irregularity strength. Discrete Applied Mathematics, 158(11), 1189–1194. https://doi.org/10.1016/j.dam.2010.02.003