Aalipour-Hafshejani et al.'s domination-polynomial uniqueness conjecture for complete bipartite graphs
Statement
Let , and let denote the complete bipartite graph with parts of sizes and . Two graphs are -equivalent when they have the same domination polynomial.
Aalipour-Hafshejani et al.'s conjecture. For all , if , then is -unique; that is, every graph with the same domination polynomial as 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.