Complete solution to a conjecture on the maximal energy of unicyclic graphs

From MaRDI portal
Publication:641541

DOI10.1016/J.EJC.2011.02.011zbMATH Open1235.05088arXiv1011.4658OpenAlexW2008940909WikidataQ123269721 ScholiaQ123269721MaRDI QIDQ641541FDOQ641541


Authors: Bofeng Huo, Yongtang Shi, Xueliang Li Edit this on Wikidata


Publication date: 24 October 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: For a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let Pnell be the unicyclic graph obtained by connecting a vertex of Cell with a leaf of Pnell,. In [G. Caporossi, D. Cvetkovi'c, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with extremal energy, {it J. Chem. Inf. Comput. Sci.} {�f 39}(1999) 984--996], Caporossi et al. conjectured that the unicyclic graph with maximal energy is Cn if nleq7 and n=9,10,11,13,15,, and Pn6 for all other values of n. In this paper, by employing the Coulson integral formula and some knowledge of real analysis, especially by using certain combinatorial technique, we completely solve this conjecture. However, it turns out that for n=4 the conjecture is not true, and P43 should be the unicyclic graph with maximal energy.


Full work available at URL: https://arxiv.org/abs/1011.4658




Recommendations




Cites Work


Cited In (50)





This page was built for publication: Complete solution to a conjecture on the maximal energy of unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q641541)