The irregularity strength of \(tK_ p\)
The irregularity strength of a simple graph is the smallest integer for which the edges may be assigned weights not exceeding it, such that the weight sums of adjacent edges are different at all vertices. A general formula is obtained for the irregularity strength of disjoint unions of identical complete graphs.
scientific article; zbMATH DE number 810275