Wiener Index of Quadrangulation Graphs
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≥ 4, simple quadrangulation graph G, equation*W(G)≤ cases 112n3+76n-2, & n 0~(mod \ 2),\\ 112n3+1112n-1, & n 1~(mod \ 2). cases equation* In this paper, we confirm this conjecture.
0