Year: 2021
Type: article
Abstract: For a graph G, let uv be an edge of G.The weight of uv is defined as 2(d(u) + d(v)) -1 , where d(u) and d(v) denote the degree of the vertices u and v, respectively.In this paper, we consider the harmonic index H(G) which is the sum of weights of all edges of G, and obtain the extremal values of trees in terms of the order and domination number of G.We also characterize the extremal trees.
Source: Discrete Mathematics Letters
Authors: Xipeng Hu, Lingping Zhong
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
Awards: G346907836, G7598218846
OpenAlex ID: W4200465780
