[1] L. Collatz and U. Sinogowitz, “Spektren endlicher grafen,” Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 21, pp. 63–77 (1957).[2] F. K. Bell, “A note on the irregularity of a graph,” Linear Algebra and Its Applications, vol. 161, pp. 45–54 (1992).[3] B. Furtula, I. Gutman, Z. K. Vukičević, G. Lekishvili, and G. Popivoda, “On an old/new degree based topological index,” Bulletin de l’Académie Serbe des Sciences et des Arts (Classe des Sciences Mathématiques et Naturelles), vol. 40, pp. 19–31 (2015).[4] I. Gutman, “Irregularity of molecular graph,” Kragujevac Journal of Science, vol. 38, pp. 99–109 (2016).[5] M. O. Albertson, “The irregularity of a graph,” Ars Combinatoria, vol. 46, pp. 219–225 (1997).[6] Y. Alavi, A. Boals, G. Chartrand, P. Erdős, and O. R. Oellermann, “k-path irregular graphs,” Congressus Numerantium, vol. 65, pp. 201–210 (1998).[7] Y. Alavi, G. Chartrand, F. R. K. Chung, P. Erdős, R. L. Graham, and O. R. Oellermann, “Highly irregular graphs,” Journal of Graph Theory, vol. 11, pp. 235–249 (1987).[8] Y. Caro and R. Yuster, “Graphs with large variance,” Ars Combinatoria, vol. 57, pp. 151–162 (2000).[9] G. Chartrand, P. Erdős, and O. R. Oellermann, “How to define an irregular graph,” The College Mathematics Journal, vol. 19, pp. 36–42 (1988).[10] D. Rautenbach, “Propagation of mean degrees,” Electronic Journal of Combinatorics, vol. 11, no. N11 (2004).[11] D. Rautenbach and I. Schiermeyer, “Extremal problems for imbalanced edges,” Graphs and Combinatorics, vol. 22, pp. 103–111 (2006).[12] M. K. Hashmi, A. U. R. Virk, A. J. M. Khalaf, and M. R. Farahani, “Computing irregularity measures for Sudoku graph,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 2, pp. 487–498 (2021).[13] S. M. Kang, A. Asghar, H. Ahmad, and Y. C. Kwun, “Irregularity of Sierpinski graph,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 7, pp. 1269–1280 (2019).[14] H. Abdo, S. Brandt, and D. Dimitrov, “The total irregularity of a graph,” Discrete Mathematics and Theoretical Computer Science, vol. 16, no. 1, pp. 201–206 (2014).[15] D. Dimitrov and R. Škrekovski, “Comparing the irregularity and the total irregularity of graphs,” Ars Mathematica Contemporanea, vol. 9, pp. 45–50 (2015).[16] S. Alikhani and N. Ghanbari, “Introduction to total dominator edge chromatic number,” TWMS Journal of Applied and Engineering Mathematics, vol. 12, no. 3, pp. 786–798 (2022).[17] S. Alikhani, N. Ghanbari, and S. Soltani, “Total dominator chromatic number of k-subdivision of graphs,” Ars Discret. Appl. Math., vol. 6, no. 1, paper 1.10 (2023).[18] Ch. S. Babu and A. A. Diwan, “Subdivisions of graphs: A generalization of paths and cycles,” Discrete Mathematics, vol. 308, pp. 4479–4486 (2008).[19] C. Bujtás, N. Ghanbari, and S. Klavžar, “Computational complexity aspects of super domination,” Theoretical Computer Science, vol. 975, paper 114137 (2023).[20] S. Klavžar, K. Knauer, and T. Marc, “On the Djoković–Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 86, pp. 327–342 (2021).[21] V. Lozin and I. Razgon, “Tree-width dichotomy,” European Journal of Combinatorics, vol. 103, paper 103517 (2022).[22] F. Wang and X. Liu, “Coloring 3-power of 3-subdivision of subcubic graph,” Discrete Mathematics, Algorithms and Applications, vol. 10, paper 1850041 (2018).[23] P. D. Seymour and R. W. Weaver, “A generalization of chordal graphs,” Journal of Graph Theory, vol. 8, no. 2, pp. 241–251 (1984).[24] N. Ghanbari and S. Alikhani, “More on the total dominator chromatic number of a graph,” Journal of Information and Optimization Sciences, vol. 40, no. 1, pp. 157–169 (2019).[25] N. Ghanbari, G. Jäger, and T. Lehtilä, “Super domination: Graph classes, products and enumeration,” Discrete Applied Mathematics, vol. 349, pp. 8–24 (2024).