Wiener index of graphs with radius two
type: Item
instance of: scholarly article
title: Wiener index of graphs with radius two
zbMATH Open document ID: 1264.05043
DOI: 10.1155/2013/906756
author: Yanyan Li
published in: ISRN Combinatorics
publication date: 2013-06-03T00:00:00Z
review text: Summary: 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 \textit{Z. You} and \textit{B. Liu} [MATCH Commun. Math. Comput. Chem. 66, No. 1, 343--344 (2011; Zbl 1264.05040)].
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 92E10
zbMATH DE Number: 6169815
zbMATH Keywords: minimum Wiener index
zbMATH Keywords: given radius
zbMATH Keywords: sum of distances
zbMATH Keywords: molecular graph
Wikidata QID: Q59000394
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/906756
OpenAlex ID: W1973404689
cites work: Wiener index of trees: Theory and applications
cites work: Q3424766
cites work: Q4692391
cites work: Q3649826
cites work: Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
cites work: On the Wiener index of random trees
cites work: Q3144349
cites work: Q3643760
cites work: Q4903423
cites work: Q3377651
cites work: Q3643759
cites work: On the sum of all distances in a graph or digraph
cites work: Spanning trees with many leaves and average distance
cites work: Maximum induced trees in graphs
description: scientific article; zbMATH DE number 6169815