On unicyclic graphs with given number of pendent vertices and minimal energy (Q2174094)

A unicyclic graph of order \(n\) is a connected graph on \(n\) vertices and \(n\) edges. The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two special families of unicyclic graphs on \(n\) vertices and \(p\) vertices of degree~1 are considered: \(R_n^{4,p}\), where a star is attached to a 4-cycle by a path; and \(S_n^{4,p}\), where \(p-1\) vertices of degree~1 and a path are attached to one vertex of a 4-cycle. The main result of the paper is that for \( 2\leq p \leq n-5 \) the energy of \(R_n^{4,p}\) is strictly less than the energy of \(S_n^{4,p}\), thereby correcting the work of \textit{H. Hua} and \textit{M. Wang} [ibid. 426, No. 2--3, 478--489 (2007; Zbl 1131.05051)].