Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number
Ars Combinatoria · 30.06.2024 · 159 (1) · 179-186
DOI: 10.61091/ars159-15 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 30.06.2024. Verfasst von Roslan Hasni und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
Let \( G=(V,E) \) be a simple connected graph with vertex set \( G \) and edge set \( E \). The harmonic index of graph \( G \) is the value \( H(G)=\sum_{uv\in E(G)} \frac{2}{d_u+d_v} \), where \( d_x \) refers to the degree of \( x \). We obtain an upper bound for the harmonic index of trees in terms of order and the total domination number, and we characterize the extremal trees for this bound.
Zitieren
APA
Hasni, R., Movahedi, F., Kamarulhaili, H., & Akhbari, M. H. (2024). Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number. Ars Combinatoria, 159(1), 179-186. https://doi.org/10.61091/ars159-15
Vancouver
Hasni R, Movahedi F, Kamarulhaili H, Akhbari MH. Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number. Ars Combinatoria. 2024;159(1):179-186. doi:10.61091/ars159-15
BibTeX
@article{Hasni2024,
author = {Hasni, Roslan and Movahedi, Fateme and Kamarulhaili, Hailiza and Akhbari, Mohammad Hadi},
title = {Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number},
journal = {Ars Combinatoria},
year = {2024},
volume = {159},
number = {1},
pages = {179--186},
doi = {10.61091/ars159-15}
}
EUVIMED