The irregularity strength of generalized Petersen graphs
Stanislav Jendrol′, Vladimír Žoldák · Czech digital mathematics library · 1995
The generalized Petersen graph P(n,k), n>3, l • • • >0n} and edges {aibi, aiai+i,bibi+k : i = l,2,...,n; subscripts modulo n}.Assign positive integer weights to the edges of P(n, k) in such a way that the graphs become irregular, i.e. the weight sums at the vertices become pairwise distinct.The minimum of the largest weights assigned over all such irregular assignments on P(n, k) is determined.