ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be a path, CnC_n a cycle, and let Pn6P_n^6 be the graph obtained by connecting a vertex of C6C_6 to a terminal vertex of Pn−6P_{n-6}. Among all unicyclic graphs on nn vertices, the cycle CnC_n has maximal energy if n≤7n\leq 7 and n=9,10,11,13n=9,10,11,13 and 1515. Caporossi's conjecture. For all other values of nn, the unicyclic graph with maximal energy is Pn6P_n^6. The conjecture was stated as a conjecture on maximal energy among unicyclic graphs and is completely solved in the source's subsequent theorem, which adds the exceptional case n=4n=4, where P43P_4^3 is maximal.

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.