Note on the harmonic index of a graph
classification
🧮 math.CO
keywords
harmonicindexgraphnoteapplboundsdefineddegree
read the original abstract
The harmonic index of a graph $G$ is defined as the sum of weights $\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The harmonic index on graphs, Appl. Math. Lett. 25 (2012), 561--566] and establish some upper and lower bounds on the harmonic index of $G$.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Sharp bounds between the saturation number and the harmonic index
For nontrivial trees, 1/4 H(T) < μ*(T) < 3/2 H(T) with both constants sharp; the TxGraffiti conjecture is false, with F4 and the subdivided star as smallest counterexamples.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.