The characterization of graphs with tree reconfiguration graphs
Statement
Let be a graph, and let denote its reconfiguration graph. Here, is the graph whose vertices represent minimal domination sets of , with adjacency given by the reconfiguration relation defined in the paper. Let be the edgeless graph on vertices, let be the star with leaves, and let denote disjoint union.
Tree reconfiguration graph conjecture. is a tree if and only if
for some non-negative integers and .
The conjecture seeks a complete characterization of graphs whose minimal-domination-set reconfiguration graph is a tree. The paper establishes several related connectivity and characterization results, but the stated equivalence is presented as a conjecture.
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.