Irregularity strength of the toroidal grid (Q1356786): Difference between revisions

The irregularity strength of a graph \(G\) is the smallest integer \(k\) for which there exists an assignment of positive integers at most \(k\) to the edges of \(G\) such that for every two distinct vertices the sums of the weights of the edges incident with each of these vertices are distinct. The author shows that the irregularity strength of the toroidal grid \(C_m\times C_n\) is \(\lceil(mn+ 3)/4\rceil\).