On the Wiener index and the hyper-Wiener index of the Kragujevac trees
DOI:
https://doi.org/10.22199/issn.0717-6279-4804Keywords:
Wiener index, Hyper-Wiener index, Kragujevac treeAbstract
In this paper, the Wiener index and the hyper-Wiener index of the Kragujevac trees is computed in term of its vertex degrees. As application, we obtain an upper bond and a lower bound for the Wiener index and the hyper-Wiener index of these trees.
References
M. Randić, “Novel molecular descriptor for structure-property studies”, Chemical Physics Letters, vol. 211, no. 4, pp. 478-483, 1993. https://doi.org/10.1016/0009-2614(93)87094-J
D. J. Klein, I. Lukovits, and I. Gutman, “On the definition of the hyper-Wiener index for cycle-containing structures”, Journal of Chemical Information and Computer Sciences, vol. 35, no. 1, pp. 50-52, 1995. https://doi.org/10.1021/ci00023a007
R. Cruz, I. Gutman and J. Rada, “Topological indices of Kragujevac tres”, Proyecciones (Antofagasta), vol. 33, no. 4, pp. 471-482, 2014. https://doi.org/10.4067/S0716-09172014000400008
B. Furtula, I. Gutman, M. Ivanović and D. Vukićevi, “Computer search for trees with minimal ABC index”, Applied Mathematics and Computation, vol. 219, pp. 767-772, 2012. https://doi.org/10.1016/j.amc.2012.06.075
I. Gutman and B. Furtula, “Trees with smallest atom-bond connectivity index”, MATCH Communications in Mathematical and in Computer Chemistry, vol. 68, pp. 131-136, 2012. [On line]. Available: https://bit.ly/41gWmnW
I. Gutman, B. Furtula and M. Ivanović, “Notes on trees with minimal atom-bond connectivity index”, MATCH Communications in Mathematical and in Computer Chemistry, vol. 67, pp. 467-482, 2012. [On line]. Available: https://bit.ly/3M6cNPK
Published
How to Cite
Issue
Section
Copyright (c) 2023 Abbas Heydari

This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.