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

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

2010-11-21

arxiv.org/abs/1011.4658v2

Mathematics

Combinatorics

15 pages

Scientific paper

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 $P_n^{\ell}$ be the unicyclic graph obtained by connecting a vertex of $C_\ell$ with a leaf of $P_{n-\ell}$\,. 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.} {\bf 39}(1999) 984--996], Caporossi et al. conjectured that the unicyclic graph with maximal energy is $C_n$ if $n\leq 7$ and $n=9,10,11,13,15$\,, and $P_n^6$ 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 $P_4^3$ should be the unicyclic graph with maximal energy.

Affiliated with

Also associated with

No associations

Rating

Complete solution to a conjecture on the maximal energy of unicyclic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complete solution to a conjecture on the maximal energy of unicyclic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complete solution to a conjecture on the maximal energy of unicyclic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221411