Šoltés graph uniqueness conjecture
Statement
Let denote the cycle on eleven vertices. A Šoltés graph is a graph for which deleting any vertex leaves the Wiener index unchanged. Šoltés graph uniqueness conjecture. The cycle on eleven vertices, , is the only Šoltés graph. The source notes that this is reinforced by the absence of Šoltés graphs among vertex-transitive graphs with fewer than vertices, but gives no resolution.
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.