Work

Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number

Year: 2024
Type: article
Abstract: 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.
Language: English
Open Access status: hybrid
OpenAlex ID: W4400512486
FWCI: 0.833
Cites: 12
Cited by: 3
Related to: 10