ON CONSTRUCTING $H$-IRREGULARITY LABELING WITH MINIMUM LABEL FOR CERTAIN BALLOON GRAPHS

Authors

DOI:

https://doi.org/10.25077/jmua.15.3.346-357.2026

Keywords:

balloon graph, double balloon graph, double balloon ladder graph, total H-irregularity strength

Abstract

If $\varrho$ and $H$ are simple, connected, undirected graphs, and $\varrho$ can be covered by an $H$-covering, then for a positive integer $p$, a total $p$-labeling $\varphi$ on $\varrho$ is considered as a total $H$-irregular $p$-labeling if, for every subgraph $K$ of $\varrho$ that is isomorphic to $H$, the weight of $K$ (the sum of the labels of all vertices and edges of $K$) is a unique number. The smallest integer $p$ for which graph $\varrho$ can be labeled with a total $H$-irregular $p$-labeling is called the total $H$-irregularity strength of graph $G$. This paper presents the exact total $H$-irregularity strength values for some particular graphs including balloon graphs, double balloon graphs, and double balloon ladder graphs.

Downloads

Download data is not yet available.

References

[1] Wilson, R. J., 2010, Introduction to graph theory, Fifth Edition, Pearson

[2] Wallis, W. D., 2007, A beginner's guide to graph theory, Springer Science & Business Media

[3] Gallian, J. A., 2022, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 1

[4] Chartrand, G., Jacobson, M. S., Lehel, J., 1988, Irregular networks. Congr. Numer., Vol. 64: 187 - 192

[5] Ashraf, F., Baca, M., Lascsakova, M., Semanicova-Fenovcikova, A., 2017, On H-irregularity strength of graphs, Discussiones Mathematicae Graph Theory, Vol. 37(4): 1067 - 1078

[6] 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, Vol. 855: 012004

[7] Nisviasari, R., Dafik, D., Agustin, I. H., 2019, The total H-irregularity strength of triangular ladder and grid graphs, Journal of Physics: Conference Series, Vol. 1465(1): 012026

[8] 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, Vol. 1465(1): 012020

[9] 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

[10] Wahyujati, M. F., Susanti, Y., 2022, Computing the total H-irregularity strength of edge comb product of graphs, Analele Stiintifice ale Universitatii Ovidius Constanta. Seria Matematica, Vol. 31(2): 177 - 189

[11] Shulhany, M. A., et al., 2022, The total H-irregularity strength of some graph classes, AIP Conference Proceedings, Vol. 2468: 070005

[12] Labane, H., Bouchemakh, I., and Semanicova-Fenovcikova, A., 2022, On H-irregularity strength of cycles and diamond graphs Discrete Mathematics, Algorithms and Applications, Vol. 14(5): 2150157

Downloads

Published

31-07-2026

How to Cite

Mursalina, M., & Susanti, Y. (2026). ON CONSTRUCTING $H$-IRREGULARITY LABELING WITH MINIMUM LABEL FOR CERTAIN BALLOON GRAPHS. Jurnal Matematika UNAND, 15(3), 346–357. https://doi.org/10.25077/jmua.15.3.346-357.2026

Issue

Vol. 15 No. 3 (2026)

Section

Articles

License

Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.

Copyright Holder

The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.

Author Rights

Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:

  • Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.

  • Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.

  • Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.

Creative Commons License (CC BY-SA 4.0)

Under the CC BY-SA 4.0 license, users are free to:

  • Share: Copy and redistribute the material in any medium or format.

  • Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.

These permissions are subject to the following conditions:

  • Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.

  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.

  • No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.

For more information about the CC BY-SA 4.0 license, please visit:

https://creativecommons.org/licenses/by-sa/4.0/

Third-Party Content

Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.

Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.

Copyright and Licensing Information

Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.