A Study of the Impact of Bounds on Topological Indices with Selected Model of the Albertson Index and the Sigma Index
DOI:
https://doi.org/10.25077/jmua.15.4.481-494.2026Keywords:
Tree, Degree Sequence, Bounds, Zagreb, Topological, Isomorphic.Abstract
In this paper, we investigate the impact of bounds on selected topological indices by examining their extreme values. We consider the Albertson index and the Sigma index as the selected models. The Sigma index is defined as the sum of the squared differences between the degrees of adjacent vertices in a graph. Additionally, we derive bounds for the minimum and maximum Albertson indices for various tree structures. We also establish upper and lower bounds involving parameters such as the maximum degree and the minimum degree.
Downloads
References
[1] H. Abdo, S. Brandt, and D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Comput. Sci. 16 (1), 201–206 (2014).
[2] H. Abdo, D. Dimitrov, I. Gutman, Graphs with maximal $sigma$- irregularity, Discrete Appl. Math., Elsevier B.V, 2018, DOI: 10.1016/j.dam.2018.05.013.
[3] A. Ali, D. Dimitrov, T. Reti, A. M. Albalahi, A. E. Hamza, Bounds and Optimal Results for the Total Irregularity Measure, arXiv:2501.01538 [math.CO] arXiv, e-prints, 2025.
[4] M. O. Albertson, The irregularity of graph, Ars Comb. 46, 219–225 (1997).
[5] E. O. D. Andriantiana and S. Wagner, Spectral moments of trees with given degree sequence, Linear Algebra Appl. 439(12), 3980–4002 (2013).
[6] A. Ashrafi, A. Ghalavand, and D. Dimitrov, On The Irregularity Of Graphs Based On The Arithmetic–geometric Mean Inequality, Math. Inequal. Appl. 26(1), 151–160 (2023).
[7] F. K. Bell, A note on the irregularity of graphs, Lin. Algebra Appl. 161, 45–54 (1992).
[8] G. Chartrand and P. Zhang, A first course in graph theory, Dover Publications, 2012.
[9] L. H. Clark, L. A. Szekely, and R. C. Entringer, An inequality for degree sequences, Discrete Math. 103, 293–300 (1992).
[10] S. Dorjsembe, L. Buyantogtokh, I. Gutman, B. Horoldagva, T. Reti, Irregularity of Graphs, J. Commun. Math. Comput. Chem. 89, 371–388 (2023).
[11] B. Furtula and I. Gutman, A forgotten topological index, J. Math. Chem. 53(4), 1184–1190 (2015).
[12] A. Ghalavand, A. Ashrafi, and R. , Ordering of c-cyclic graphs with respect to total irregularity, Math. Inequal. Appl. 26(1), 151–160 (2023).
[13] I. Gutman, P. Hansen, and H. Melot, Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees, J. Chem. Inf. Model. 45, 222–230 (2005).
[14] I. Gutman, M. Togan, A. Yurttas, A. S. Cevik, and I. N. Cangul, Inverse Problem for Sigma Index, MATCH Commun. Math. Comput. Chem. 79(2), 491–508 (2016).
[15] I. Gutman and N. Trinajstic, Graph theory and molecular orbitals. Total $pi$-electron energy of alternant hydrocarbons, Chem. Phys. Lett. 17, 535–538 (1972).
[16] I. Gutman, B. Ruscc, N. Trinajstic, and C. F. Wilcox, Graph theory and molecular orbitals. 12. Acyclic polyenes, J. Chem. Phys. 62, 3399–3405 (1975).
[17] J. Hamoud, D. Abdullah, Topological Indices with Degree Sequence D of Tree, arXiv:2503.12909 [math.CO], arXiv, e-prints, 2025.
[18] T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs, Marcel Dekker, Inc., 1998.
[19] Z. Lina, T. Zhoub, and L. Miaob, The general Albertson irregularity index of graphs, AIMS Math. 7(1), 267–282 (2024).
[20] J. B. Liu, C. Wang, and S. Wang, Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs, Bull. Malays. Math. Sci. Soc. 42, 67–78 (2019).
[21] M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct. Algorithms. 6(2-3), 161–180 (1995).
[22] R. Nasiri, G. H. Fath Tabar, and I. Gutman, Extremely Irregular Trees, Bull. Acad. Sci. Serbe, Classe Sci. Math. Nat. 38, 2013.
[23] S. Nikolic, G. Kovacevic, A. Milicevic, and N. Trinajstic, The Zagreb indices 30 years after, Croat. Chem. Acta. 76(2), 113–124 (2003).
[24] J. Yang and H. Deng, The Extremal Sigma Index of Connected Graphs with Given Number of Pendant Vertices, Research Square, 2023.
[25] X. M. Zhang, X. D. Zhang, D. Gray, and H. Wang, The number of subtrees of trees with given degree sequence, J. Graph Theory. 73(3), 280–295 (2013).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND
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 (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all 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). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA 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, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â
