Unicyclic graphs with given number of pendent vertices and minimal energy (Q996304): Difference between revisions

The energy of a graph \(G\) is the sum of the absolute values of all eigenvalues of the adjacency matrix of \(G\). In this paper the authors characterize graphs having minimal energy among all elements of \(G(n,p)\), the class of unicyclic graphs with \(n\) vertices and \(p\) pendent vertices (see Theorem 15). Moreover, the authors use and cite more than 15 previous papers concerning the energy of a graph.