A New Upper Bound for the Irregularity Strength of Graphs
Maciej Kalkowski, M. Karoński, Florian Pfender · SIAM Journal on Discrete Mathematics · 2011
A weighting of the edges of a graph is called irregular if the weighted degrees of the vertices are all different. In this note we show that such a weighting is possible from the weight set [Formula: see text] for all graphs not containing a component with exactly two vertices or two isolated vertices.