Dankelmann–Swart–Oellermann conjecture on Steiner diameter of highly connected graphs
Statement
Let denote the -th power of the cycle . Let be a -connected graph of order . Dankelmann–Swart–Oellermann conjecture.
This conjectures that the -th power of the cycle maximizes the Steiner -diameter among -connected graphs of order , generalizing the stated extremal result for -connected graphs. The supplied text 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.