On the irregularity strength of the m ร
โ
Jeffrey H. Dinitz; David K. Garnick; Andras Gyรกrfรกs
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 939 KB
## Abstract Given a graph __G__ with weighting __w__: __E__(__G__) โ __Z__^+^, the __Strength__ of __G__(__w__) is the maximum weight on any edge. The __sum__ of a vertex in __G__(__w__) is the sum of the weights of all its incident edges. The network __G__(__w__) is __irregular__ if the vertex sum