ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,b∈Na,b\in\mathbb{N}, and let K(a,b){\cal K}(a,b) denote the complete bipartite graph with parts of sizes aa and bb. Two graphs are D{\cal D}-equivalent when they have the same domination polynomial.

Aalipour-Hafshejani et al.'s conjecture. For all a,b∈Na,b\in\mathbb{N}, if ∣a−b∣≥2|a-b|\geq 2, then K(a,b){\cal K}(a,b) is D{\cal D}-unique; that is, every graph with the same domination polynomial as K(a,b){\cal K}(a,b) is isomorphic to it.

This conjecture concerns whether complete bipartite graphs with unequal parts differing by at least two are determined by their domination polynomial. The paper states that its results settle the conjecture affirmatively: any two such complete bipartite graphs with the same domination polynomial are isomorphic.

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.