Caporossi–Cvetković–Gutman–Hansen conjecture on maximal energy of unicyclic graphs
Statement
Let be the cycle on vertices. Let be the unicyclic graph obtained by connecting a vertex of the cycle to a leaf of the path . For a graph with adjacency-matrix eigenvalues , its energy is
Caporossi–Cvetković–Gutman–Hansen conjecture. Among all unicyclic graphs on vertices, the cycle has maximal energy if or . For all other values of , the unicyclic graph with maximal energy is .
The conjecture identifies the extremal unicyclic graph by the number of vertices and concerns the adjacency-spectrum energy of graphs. The supplied text does not state whether the conjecture has been resolved.
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.