Ordering trees having small reverse Wiener indices

Details Ordering trees having small reverse Wiener indices Ordering trees having small reverse Wiener indices

2010-10-28

arxiv.org/abs/1010.5867v1

Mathematics

Combinatorics

Scientific paper

The reverse Wiener index of a connected graph $G$ is a variation of the well-known Wiener index $W(G)$ defined as the sum of distances between all unordered pairs of vertices of $G$. It is defined as $\Lambda(G)=\frac{1}{2}n(n-1)d-W(G)$, where $n$ is the number of vertices, and $d$ is the diameter of $G$. We now determine the second and the third smallest reverse Wiener indices of $n$-vertex trees and characterize the trees whose reverse Wiener indices attain these values for $n\ge 6$ (it has been known that the star is the unique tree with the smallest reverse Wiener index).

Affiliated with

Also associated with

No associations

Rating

Ordering trees having small reverse Wiener indices 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 Ordering trees having small reverse Wiener indices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ordering trees having small reverse Wiener indices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583075