Šoltés graph uniqueness conjecture

Let C11C_{11} 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, C11C_{11}, 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 4848 vertices, but gives no resolution.

Sources & referencesView supporting material

Primary source

Nino Bašić, Martin Knor and Riste Škrekovski, “On regular graphs with Šoltés vertices”, arXiv:2303.11996 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.