2000 character limit reached
On a Conjecture on the Wiener Index of a Maximal Planar Graph
Published 30 Nov 2019 in math.CO | (1912.00128v4)
Abstract: We prove that the Wiener Index $W(G)$ of a Maximal Planar graph $G$ with $n$ vertices satisfies $W(G) \leq \Big{\lfloor} \frac{1}{18}(n3 + 3n2) \Big{\rfloor}$ for $3 \leq n \leq 18$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.