ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the cycle graph on nn vertices, let K1K_1 be the one-vertex graph, and let Cn⊙K1C_n\odot K_1 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 n≥6n\ge 6, the graph Cn⊙K1C_n\odot K_1 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 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.