The modular irregularity strength of middle graphs of path graphs, triangular snake graphs, and diamond graphs
DOI:
https://doi.org/10.13069/jacodesmath.v14i1.428Keywords:
Modular irregularity, Middle path graph, Triangular snake graph, Diamond graphAbstract
Given a simple undirected graph, a modular irregularity labeling is an edge labeling that maps each edge to a positive integer such that the weight of all vertices is distinct. The weight of a vertex is defined as the sum of the label values of the incident edges modulo a certain number, and it is bijective. The minimum value from the range of labelings that allows the graph to have a modular irregularity labeling is known as the graph's modular irregularity strength. This study explicitly establishes the modular irregularity strength for three specific graph classes: the middle graph of a path graph, the triangular snake graph, and the diamond graph, all of which have not been previously studied. The method used in this study involves explicit construction and analysis of the upper and lower bounds of the modular irregularity strength for the graphs. Research on modular irregularity labeling is important theoretically because it can deepen the understanding of more complex graph structures and optimize labeling.
Received: 30 November 2025 | Revised: 10 June 2026 | Accepted: 01 September 2026
Downloads
References
M. Anholcer, S. Cichacz, and M. Milanič, Group irregularity strength of connected graphs, J. Comb. Optim. 30 (2015) 1–17.
M. Anholcer and S. Cichacz-Przenioslo, Group irregular labelings of disconnected graphs, Contrib. Discrete Math. 12(2) (2017) 158–166.
M. Bača, M. Imran, and A. Semaničová-Feňovčíková, Irregularity and modular irregularity strength of wheels, Mathematics 9(21) (2021) 2710.
M. Bača, S. Jendrol', M. Miller, and J. Ryan, On irregular total labellings, Discrete Math. 307(11--12) (2007) 1378–1388.
M. Bača, Z. Kimáková, M. Lascsáková, and A. Semaničová-Feňovčíková, The irregularity and modular irregularity strength of fan graphs, Symmetry 13(4) (2021) 605.
M. Bača, M. Lascsáková, and A. Semaničová-Feňovčíková, Modular H-irregularity strength of graphs, Mathematics 13(16) (2025) 2599.
M. Bača, K. Muthugurupackiam, K. M. Kathiresan, and S. Ramya, Modular irregularity strength of graphs, Electron. J. Graph Theory Appl. 8(2) (2020) 435–443.
Z. Z. Barack and K. A. Sugeng, Modular irregularity strength of disjoint union of cycle-related graph, ITM Web Conf. 61 (2024) 01001.
Z. Z. Barack, K. A. Sugeng, A. Semaničová-Feňovčíková, and M. Bača, Modular irregularity strength of the corona product of graphs, Discrete Math. Lett. 13 (2024) 111–116.
G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz, and F. Saba, Irregular networks, Congr. Numer. 64 (1988) 197–210.
A. Frieze, R. J. Gould, M. Karo\'nski, and F. Pfender, On graph irregularity strength, J. Graph Theory 41(2) (2002) 120–137.
J. A. Gallian, A dynamic survey of graph labelling, Electron. J. Combin. (1998) \#DS6: Oct 30, 2025.
T. Hamada and I. Yoshimura, Traversability and connectivity of the middle graph of a graph, Discrete Math. 14(3) (1976) 247–255.
J. Ivanco and J. S. Jendrol', Total edge irregularity strength of trees, Discuss. Math. Graph Theory 26(3) (2006) 449–456.
S. Jendrol', J. Miškuf, and R. Soták, Total edge irregularity strength of complete graphs and complete bipartite graphs, Discrete Math. 310 (2010) 400–407.
L. Ratnasari and Y. Susanti, Total edge irregularity strength of ladder-related graphs, Asian Eur. J. Math. 13(4) (2020) 2050072.
F. Salama, Computing the total edge irregularity strength for quintet snake graph and related graphs, J. Discrete Math. Sci. Cryptogr. 25(8) (2022) 2491–2504.
F. Salama and R. M. A. Elanin, On total edge irregularity strength for some special types of uniform theta snake graphs, AIMS Math. 6(8) (2021) 8127–8148.
M. A. Shulhany and A. N. M. Salman, The rainbow connection number of diamond graphs (in Indonesian), Proc. Natl. Seminar Math. and Math. Educ. UMS 1 (2015) 916–924.
K. A. Sugeng, Z. Z. Barack, N. Hinding, and R. Simanjuntak, Modular irregular labeling on double-star and friendship graphs, J. Math. 2021(1) (2021) 4746609.
K. A. Sugeng, Z. Z. Barack, P. John, and A. Bustamam, Modular irregularity strength on some corona products of graphs, J. Indones. Math. Soc. 32(1) (2026) 2248.
K. A. Sugeng, P. John, M. L. Lawrence, L. F. Anwar, M. Bača, and A. Semaničová-Feňovčíková, Modular irregularity strength on some flower graphs, Electron. J. Graph Theory Appl. 11(1) (2023).
I. N. Suparta, M. Candiasa, W. A. Prasancika, and M. Bača, Modular irregularity strength of dense graphs, Electron. J. Graph Theory Appl. 12(1) (2024).
Y. Susanti, Y. I. Puspitasari, and H. Khotimah, On total edge irregularity strength of staircase graphs and related graphs, Iran. J. Math. Sci. Inform. 15(1) (2020) 1–13.
Y. Susanti, S. Wahyuni, A. Sutjijana, S. Sutopo, and I. Ernanto, Generalized arithmetic staircase graphs and their total edge irregularity strengths, Symmetry 14 (2022) 1853.
S. K. Vaidya and R. M. Pandit, Edge domination in various snake graphs, Int. J. Math. Soft Comput. 7(1) (2017) 43–50.
E. Wulandari and Y. Susanti, On total edge irregularity strength of arithmetic ladder graphs, AIMS Math. 11(4) (2026) 10175–10190.
