ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let R(G)\mathcal{R}(G) denote its reconfiguration graph. Here, R(G)\mathcal{R}(G) is the graph whose vertices represent minimal domination sets of GG, with adjacency given by the reconfiguration relation defined in the paper. Let Kn‾\overline{K_n} be the edgeless graph on nn vertices, let K1,mK_{1,m} be the star with mm leaves, and let ∪\cup denote disjoint union.

Tree reconfiguration graph conjecture. R(G)\mathcal{R}(G) is a tree if and only if

G≅Kn‾∪K1,mG \cong \overline{K_n} \cup K_{1,m}

for some non-negative integers mm and nn.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.