Abstract
Let G=(V(G), E(G)) be a simple connected graph. The harmonic number of G, denoted by H(G), is defined as the sum of the weights 2/(d(u)+d(v)) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this paper, some extremal problems on the harmonic number of trees are studied. The extremal values on the harmonic number of trees with given graphic parameters, such as pendant number, matching number, domination number and diameter, are determined. The corresponding extremal graphs are characterized, respectively.
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.
