Determination of corona cycles by Laplacian permanental polynomials
Statement
Let be the cycle graph on vertices, let be the one-vertex graph, and let denote their corona product. A graph is determined by its (signless) Laplacian permanental polynomials if no non-isomorphic graph has the same Laplacian and signless Laplacian permanental polynomials. Cycle-corona determination conjecture. For , the graph is determined by its (signless) Laplacian permanental polynomials. This conjecture concerns whether the pair of Laplacian and signless Laplacian permanental polynomials characterizes these corona graphs among graphs up to isomorphism. The source provides no resolution, so the conjecture remains open.
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.