Submitted:
15 May 2025
Posted:
15 May 2025
You are already at the latest version
Abstract
Keywords:
MSC: 2000
1. Introduction
2. Main Results



3. Concluding Remarks
Acknowledgments
References
- Agustin, I. H. , Dafik, D., Marsidi, M., and Albirri, E. R., 2017, On the total H-irregularity strength of graphs: a new notion, Journal of Physics: Conference Series. 855 (1).
- Ashraf, F. , Bača, M., Lascśaková, M., Semaničová-Feňovčíková, A., 2017, On H-irregularity strength of graphs, Discussiones Mathematicae Graph Theory, 37(4) 1067-1078.
- Chartrand, G. , Jacobson, M. S., Lehel, J., 1988, Irregular networks. Congr. Numer, 64, 187-192.
- Gallian, J. A. , 2022, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 1.
- Hidayatul, M. , Dafik, D., Agustin, I. H., Nisviasari, R., Kurniawati, E.Y., 2020, On total H-irregularity strength of graphs, Journal of Physics: Conference Series, 1465 (1).
- Labane, H. , Bouchemakh, I., and Semaničová-Feňovčíková, A., 2022, On H-irregularity strength of cycles and diamond graphs Discrete Mathematics, Algorithms and Applications 14 (5) 2150157.
- Nisviasari, R. , Dafik, D., Agustin, I. H., 2019, The total H-irregularity strength of triangular ladder and grid graphs, Journal of Physics: Conference Series, 1211 (1) 012005.
- Shulhany, M. A. , et al., 2022, The total H-irregularity strength of some graph classes, AIP Conference Proceedings, 2468 (1).
- Suni, D. M. O. , Dafik, D., Tirta, I. M., Kristiana, A. I., and Nisviasari, R., 2020, On total H-irregularity strength of diamond ladder, three circular ladder, and prism graphs, Journal of Physics: Conference Series, Vol. 1465 (1) 012021.
- Wallis, W. D. , 2007, A beginner’s guide to graph theory. Springer Science & Business Media.
- Wilson, R. J. , 2010, Introduction to graph theory, Fifth Edition, Pearson.
- Wahyujati, M. F. , Susanti, Y., 2022, Computing the total H-irregularity strength of edge comb product of graphs, " Analele ştiinţifice ale Universităţii Ovidius Constanţa. Seria Matematică, 31 (2) 177-189.



Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).