DeLaViña–Waller conjecture on the Wiener index of graphs of order 2d+1
Statement
Let be a finite connected graph, let be its diameter, let denote its Wiener index, and let denote the cycle on vertices. DeLaViña–Waller conjecture. If
then
The conjecture concerns the maximum Wiener index among graphs with prescribed diameter and order. The paper states that it proves the conjecture for relevant classes involving or cut vertices, while the general problem remains unresolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.