Wiener Index of Quadrangulation Graphs
Combinatorics
2020-01-06 v1
Abstract
The Wiener index of a graph , denoted , is the sum of the distances between all pairs of vertices in . \'E. Czabarka, et al. conjectured that for an -vertex, , simple quadrangulation graph , \begin{equation*}W(G)\leq \begin{cases} \frac{1}{12}n^3+\frac{7}{6}n-2, &\text{ ,}\\ \frac{1}{12}n^3+\frac{11}{12}n-1, &\text{ }. \end{cases} \end{equation*} In this paper, we confirm this conjecture.
Keywords
Cite
@article{arxiv.2001.00661,
title = {Wiener Index of Quadrangulation Graphs},
author = {Ervin Győri and Addisu Paulos and Chuanqi Xiao},
journal= {arXiv preprint arXiv:2001.00661},
year = {2020}
}