Abstract
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. In this paper, we survey the known extremal results about the Wiener index of trees and the roots of the Wiener polynomials of trees from 2014 together with some open problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Match Communications in Mathematical and in Computer Chemistry
Paper Title
Journal
Date
