Caporossi's maximal-energy conjecture for unicyclic graphs

Let $P_n$ be a path, $C_n$ a cycle, and let $P_n^6$ be the graph obtained by connecting a vertex of $C_6$ to a terminal vertex of $P_{n-6}$. Among all unicyclic graphs on $n$ vertices, the cycle $C_n$ has maximal energy if $n\leq 7$ and $n=9,10,11,13$ and $15$. Caporossi's conjecture. For all other values of $n$, the unicyclic graph with maximal energy is $P_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=4$, where $P_4^3$ is maximal.