Abstract
The harmonic index for trees with given domination number
Highlights
Let G = (V, E) be a simple connected graph with vertex set V and edge set E
The set of neighbours of v is defined as N (v) = {u ∈ V (G) | uv ∈ E(G)}, and d(v) = |N (v)| is called the degree of v
The maximum vertex degree of a graph G is denoted by ∆(G) = max{d(v) | v ∈ V (G)}
Summary
Denote by Pn and Sn the path and the star on n vertices, respectively. Let T (n, γ) be the set of trees with n vertices and domination number γ.
Sign-in/Register to view highlights & summary 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.
