ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite connected graph, let dd be its diameter, let W(G)W(G) denote its Wiener index, and let C2d+1C_{2d+1} denote the cycle on 2d+12d+1 vertices. DeLaViña–Waller conjecture. If

d≥3and∣V(G)∣=2d+1,d\geq 3\quad\text{and}\quad |V(G)|=2d+1,

then

W(G)≤W(C2d+1).W(G)\leq W(C_{2d+1}).

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 0,1,2,30,1,2,3 or n−4n-4 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.