Irregularity strength of the toroidal grid
From MaRDI portal
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\).
Recommendations
Cites work
Cited in
(11)- Irredundance in grids
- Total edge irregularity strength of accordion graphs
- On edge irregular total labeling of categorical product of two cycles
- Total irregularity strength of three families of graphs
- Irregular labelings of helm and sun graphs
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
- On the irregularity strength of them ×n grid
- scientific article; zbMATH DE number 822742 (Why is no real title available?)
- scientific article; zbMATH DE number 6129372 (Why is no real title available?)
- Irregular total labellings of generalized Petersen graphs
- Total edge irregularity strength of complete graphs and complete bipartite graphs
This page was built for publication: Irregularity strength of the toroidal grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356786)