Wiener Index of Graphs with Radius Two. (3rd March 2013)

• Record Type: Journal Article
• Authors: Chen, Yin; Wu, Baoyindureng; An, Xinhui
• Other Names: Siemons J. Academic Editor.; Taeri B. Academic Editor.
• Is Part Of: ISRN combinatorics. Volume 2013(2013)
• Publication Date: 2013-03-03
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Electronic journals; Periodicals; 511.6
• DOI: 10.1155/2013/906756
• Languages: English
• ISSNs: 2090-8911

Abstract

Abstract : The Wiener index of a graph is the sum of the distances between all pairs of vertices. It has been one of main descriptors that correlate a chemical compound's molecular graph with experimentally gathered data regarding the compound's characteristics. We characterize graphs with the maximum Wiener index among all graphs of order n . with radius two. In addition, we pose a conjecture concerning the minimum Wiener index of graphs with given radius. If this conjecture is true, it will be able to answer an open question by You and Liu (2011).