ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the cycle on nn vertices. Let Pn6P_n^6 be the unicyclic graph obtained by connecting a vertex of the cycle C6C_6 to a leaf of the path Pn−6P_{n-6}. For a graph GG with adjacency-matrix eigenvalues lambda1,ldots,lambdanlambda_1,ldots,lambda_n, its energy is

E(G)=∑i=1n∣λi∣.E(G)=\sum_{i=1}^n|\lambda_i|.

Caporossi–Cvetković–Gutman–Hansen conjecture. Among all unicyclic graphs on nn vertices, the cycle CnC_n has maximal energy if n≤7n\leq 7 or n∈{9,10,11,13,15}n\in\{9,10,11,13,15\}. For all other values of nn, the unicyclic graph with maximal energy is Pn6P_n^6.

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 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.