The Harary index of trees

Details The Harary index of trees The Harary index of trees

2011-04-05

arxiv.org/abs/1104.0920v3

Mathematics

Combinatorics

14 pages, 2 figures

Scientific paper

The Harary index of a graph $G$ is recently introduced topological index, defined on the reverse distance matrix as $H(G)=\sum_{u,v \in V(G)}\frac{1}{d(u,v)}$, where $d(u,v)$ is the length of the shortest path between two distinct vertices $u$ and $v$. We present the partial ordering of starlike trees based on the Harary index and we describe the trees with the second maximal and the second minimal Harary index. In this paper, we investigate the Harary index of trees with $k$ pendent vertices and determine the extremal trees with maximal Harary index. We also characterize the extremal trees with maximal Harary index with respect to the number of vertices of degree two, matching number, independence number, radius and diameter. In addition, we characterize the extremal trees with minimal Harary index and given maximum degree. We concluded that in all presented classes, the trees with maximal Harary index are exactly those trees with the minimal Wiener index, and vice versa.

Affiliated with

Also associated with

No associations

Rating

The Harary index of trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Harary index of trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Harary index of trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-321912