Symmetry characterization for independence polynomials of lexicographic products
Statement
Let and be graphs, let denote the independence polynomial of , and let denote their lexicographic product.
Symmetry characterization. is symmetric for every graph if and only if for some .
This characterizes the graphs for which lexicographic products have symmetric independence polynomials for every choice of . The source presents the statement in its conclusions, but the supplied text gives no evidence that it has been proved or resolved.
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.