Source authenticated

The DeLaViña–Waller conjecture on the Wiener index

Every finite simple connected graph $G$ with $$ |V(G)|=2d+1,\qquad \operatorname{diam}(G)=d\ge 3 $$ satisfies $$ W(G)\le W(C_{2d+1}) =\frac{(2d+1)d(d+1)}2. $$ The claimed equality cases are exactly $C_{2d+1}$ for every $d\ge3$, the double star $D_{2,3}$ when $d=3$, and the nine-vertex tree $T_{1,2,2}=S(2,3,3)$ when $d=4$.

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Aug 19, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.

Canonical aliases: The DeLaViña–Waller conjecture on the Wiener index · DeLaViña–Waller

Confidence: Not scored

Registry verification: unreviewed · preprint · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Mingchang Liu
human · human collaborator

GPT-5.6 Sol
model · ai model contributor · OpenAI

Claude Fable 5
model · ai model contributor · Anthropic

Lineage and corrections

This event attributed to Mingchang Liu

This event attributed to Claude Fable 5

This event attributed to GPT-5.6 Sol

Act on this frontier

Verify, challenge, or extend the result.