Ordering trees having small reverse Wiener indices

DOI10.2298/FIL1204637XMaRDI QIDQ5746568zbMATH OpenFDO

Authors Rundan Xing, Bo Zhou

Publication date 7 February 2014

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.5867

zbMATH Keywords

diameterdistancependant vertexreverse Wiener index

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Distance in graphs (05C12) Extremal problems in graph theory (05C35)

Abstract: 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)=frac12n(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 $nge6$ (it has been known that the star is the unique tree with the smallest reverse Wiener index).

Recommendations

• Further properties of reverse Wiener index
• Ordering the non-starlike trees with large reverse Wiener indices.
• Reverse Wiener indices of connected graphs
• On reciprocal reverse Wiener index
• Reverse Wiener indices of graphs of exactly two cycles

Cited in

(8)

• On reciprocal reverse Wiener index
• On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges
• Inverted distance and inverted Wiener index
• Ordering the non-starlike trees with large reverse Wiener indices.
• Reverse Wiener indices of connected graphs
• Further properties of reverse Wiener index
• Reverse Wiener indices of graphs of exactly two cycles
• Ordering trees with given matching number by their Wiener indices

This page was built for publication: Ordering trees having small reverse Wiener indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746568)