Dinesh Pandey, Kamal Lochan Patra
Published 2019-07-30Version 1
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pair of its vertices. In this paper, we characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on $n$ vertices with $s$ cut vertices.
Comments: 16 pages, 1 figure. arXiv admin note: text overlap with arXiv:1811.11411
On vertex peripherians and Wiener index of graphs with fixed number of cut vertices
On a relation between the Szeged index and the Wiener index for bipartite graphs
The (revised) Szeged index and the Wiener index of a nonbipartite graph
![QR code for arXiv:1907.13481 [math.CO]](http://oss.arxitics.com/images/favicon.svg)