2000 character limit reached
Wiener Index of Quadrangulation Graphs (2001.00661v1)
Published 2 Jan 2020 in math.CO
Abstract: The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. \'E. Czabarka, et al. conjectured that for an $n$-vertex, $n\geq 4$, simple quadrangulation graph $G$, \begin{equation*}W(G)\leq \begin{cases} \frac{1}{12}n3+\frac{7}{6}n-2, &\text{ $n\equiv 0~(mod \ 2)$,}\ \frac{1}{12}n3+\frac{11}{12}n-1, &\text{ $n\equiv 1~(mod \ 2)$}. \end{cases} \end{equation*} In this paper, we confirm this conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.