@article{SUN2023, 
author = {Xiaohui SUN and Xinhui AN},
title = {Sharp Bounds for Wiener Index of Maximal Outerplanar Graphs},
year = {2023},
journal = {Journal of Xinjiang University(Natural Science Edition in Chinese and English)},
volume = {40},
number = {5},
pages = {560-564},
keywords = {maximal outerplanar graph, Wiener index, extremal graphs, square graphs},
url = {https://www.sciopen.com/article/10.13568/j.cnki.651094.651316.2023.01.04.0001},
doi = {10.13568/j.cnki.651094.651316.2023.01.04.0001},
abstract = {A graph is outerplanar if it has a crossing-free embedding in the plane such that all vertices are on the boundary of its outer face. An outerplanar graph is maximal outerplanar if no edge can be added without losing outerplanarity. The Wiener index of a graph G is the sum of distances between all pairs of vertices of G. We show that for a maximal outerplanar graph G on n vertices, W(K1∨Pn−1) ≤W(G)≤W( Pn2), where K1∨Pn−1 is the graph obtained from joining a vertex to each vertex of Pn−1 and  Pn2 is the square of Pn.}
}