Caporossi's maximal-energy conjecture for unicyclic graphs
Statement
Let be a path, a cycle, and let be the graph obtained by connecting a vertex of to a terminal vertex of . Among all unicyclic graphs on vertices, the cycle has maximal energy if and and . Caporossi's conjecture. For all other values of , the unicyclic graph with maximal energy is . 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 , where 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.