The distinguishing stability bound for simple connected graphs
Statement
Let be a simple connected graph. Write for its distinguishing number and for its distinguishing stability, namely the least number of vertices whose deletion changes the distinguishing number.
Distinguishing stability conjecture.
The authors state this bound because it holds for the examples they have considered, but report that attempts to prove it have failed. Its general validity 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.