Abstract
The harmonic index of a graph $G$ is defined as $ H(G)=sumlimits_{uvin E(G)}frac{2}{d(u)+d(v)}$, where $d(u)$ denotes the degree of a vertex $u$ in $G$. Let $mathcal{G}(n,k)$ be the set of simple $n$-vertex graphs with minimum degree at least $k$. In this work we consider the problem of determining the minimum value of the harmonic index and the corresponding extremal graphs among $mathcal{G}(n,k)$. We solve the problem for each integer $k (1le kle n/2)$ and show the corresponding extremal graph is the complete split graph $K_{k,n-k}^*$. This result together with our previous result which solve the problem for each integer $k (n/2 le kle n-1)$ give a complete solution of the problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
