English

Wiener Index of Quadrangulation Graphs

Combinatorics 2020-01-06 v1

Abstract

The Wiener index of a graph GG, denoted W(G)W(G), is the sum of the distances between all pairs of vertices in GG. \'E. Czabarka, et al. conjectured that for an nn-vertex, n4n\geq 4, simple quadrangulation graph GG, \begin{equation*}W(G)\leq \begin{cases} \frac{1}{12}n^3+\frac{7}{6}n-2, &\text{ n0 (mod 2)n\equiv 0~(mod \ 2),}\\ \frac{1}{12}n^3+\frac{11}{12}n-1, &\text{ n1 (mod 2)n\equiv 1~(mod \ 2)}. \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}
}
R2 v1 2026-06-23T13:01:52.911Z