2012
DOI: 10.2298/fil1204637x
|View full text |Cite
|
Sign up to set email alerts
|

Ordering trees having small reverse wiener indices

Abstract: The reverse Wiener index of a connected graph G is a variation of the wellknown Wiener index W (G) defined as the sum of distances between all unordered pairs of vertices of G. It is defined as Λ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 ≥ 6 (it has been known that the star is the unique tree with the smallest reverse W… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…(See [8][9][10][11][12][13][14][15][16]). The Steiner Wiener index, its inverse problem and the Steiner hyper-Wiener index of a graph were studied in [8][9][10][11].…”
Section: (Iii) Other Topological Indices Associated With Wiener Indexmentioning
confidence: 99%
See 1 more Smart Citation
“…(See [8][9][10][11][12][13][14][15][16]). The Steiner Wiener index, its inverse problem and the Steiner hyper-Wiener index of a graph were studied in [8][9][10][11].…”
Section: (Iii) Other Topological Indices Associated With Wiener Indexmentioning
confidence: 99%
“…References [12][13][14] investigated the terminal Wiener index of graphs. For the results about the trees' reverse Wiener indices and ordering problem by their reverse Wiener indices, one can refer to [15,16].…”
Section: (Iii) Other Topological Indices Associated With Wiener Indexmentioning
confidence: 99%