The Wiener index of maximal outerplane graphs

Wiener index $W(G)$ of a connected undirected graph $G$ equals the sum of distances between all pairs of vertices in $G$. In this paper, an effective algorithm for calculating Wiener index of maximal outerplane graphs with a big number $n$ of vertices is offered. The time complexity of the algorithm is $\mathrm O(n^2)$. The algorithm is fit for manual calculation of Wiener index of small graphs, as well as for its calculation for computer generated graphs.