Maximum diameter of redundant non-surrounded graphs
Statement
Let be a graph of order in which every vertex is redundant and no vertex is surrounded. Its diameter is the graph distance between vertices at maximum distance.
Maximum-diameter conjecture. The maximum diameter of such a graph is
when is a power of , this maximum is attained only by the -cube and by graphs containing the -cube as a subgraph.
The -cube is given in the surrounding text as an example with vertices, diameter , all vertices redundant, and no surrounded vertices. The supplied text does not establish the asserted upper bound or the uniqueness claim.
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.