The optimal-girth conjecture for Wiener-minimizing unicyclic graphs
Statement
Let be a degree sequence with and , and let be a unicyclic graph with degree sequence . Define
and let be the greedy tree with degree sequence . If is achieved by a unique leaf, set ; otherwise set . Optimal-girth conjecture. The Wiener index of satisfies
This conjecture proposes that, without fixing the girth, a Wiener-minimizing unicyclic graph is captured by one of the two indicated constructions at the girth determined by the height of the associated greedy tree. The supplied text does not state a resolution, so the conjecture is recorded as open.
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.