An Edge Operation That Increases the Hitting Time Index of Trees
Mathematics · 14.07.2026 · 14 (14) · 2525
DOI: 10.3390/math14142525 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 14.07.2026. Verfasst von José Luis Palacios und 1 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University of New Mexico, Electrical and Computer Engineering Department.
Abstract (Originalsprache)
Suppose that G is an n-vertex tree with a path Pk attached to a vertex b∈G and with another pendant vertex c that is also attached to b. If G* is the tree constructed from G by moving the attachment point of the path from b to c, then under the hypothesis n≥2k+2 we have HT(G*)>HT(G). This result allows us to exhibit families of trees with a monotonic behavior of the values of their HT index: the index increases as the number of pendant vertices decreases, thus giving support to the conjecture that the maximum HT index among n-vertex trees is attained by the n-path.
Förderung
- University of New Mexico, Electrical and Computer Engineering Department
Zitieren
APA
Palacios, J. L., & Petojević, A. (2026). An Edge Operation That Increases the Hitting Time Index of Trees. Mathematics, 14(14), 2525. https://doi.org/10.3390/math14142525
Vancouver
Palacios JL, Petojević A. An Edge Operation That Increases the Hitting Time Index of Trees. Mathematics. 2026;14(14):2525. doi:10.3390/math14142525
BibTeX
@article{Palacios2026,
author = {Palacios, José Luis and Petojević, Aleksandar},
title = {An Edge Operation That Increases the Hitting Time Index of Trees},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {14},
pages = {2525},
doi = {10.3390/math14142525}
}
EUVIMED