Conjecture on regularity and component structure of distinguishing critical graphs
Statement
Let be a positive integer and let be a graph. The graph is -distinguishing critical if its distinguishing number is and every proper induced subgraph of has distinguishing number less than .
Regularity and component conjecture. (i) If is a -distinguishing critical graph, then is a -regular graph for some . (ii) If is a disconnected -distinguishing critical graph, then each component of is a complete graph.
The paper establishes this structure for several small values of and proves that the only distinguishing critical tree is ; the conjecture proposes the general regularity and complete-component conclusions.
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.