The strengthened Szeged–Wiener lower bound for 2-connected graphs
Statement
Let be a -connected graph of order . Let denote the complete graph, and let and be the graphs obtained from by adding one vertex adjacent to respectively or of the original vertices. Define . Strengthened Szeged–Wiener conjecture. If is not isomorphic to , , or , then
The conjecture is motivated by computer searches finding graphs with only up to order , with none on vertices. The source does not provide a proof or resolution, so the conjecture remains 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.