Knor–Škrekovski–Tepeh conjecture on maximum-Wiener-index orientations of trees
Statement
Let be a tree, and let be an orientation of . The Wiener index is the sum of the directed distances over all ordered pairs of vertices, where the distance is the length of a shortest directed path when one exists and is otherwise.
Knor–Škrekovski–Tepeh conjecture. If maximises among all orientations of , then there exists a vertex in such that for every vertex there exists either a -path or a -path in .
The conjecture concerns the structure of orientations of trees with maximum Wiener index. The supplied text does not state whether it has been proved or disproved.
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.