Bounds for the Huckel energy of a graph

Details Bounds for the Huckel energy of a graph Bounds for the Huckel energy of a graph

2009-08-19

arxiv.org/abs/0908.2667v2

Mathematics

Combinatorics

13 pages; historical points and some references added

Scientific paper

Let $G$ be a graph on $n$ vertices with $r := \lfloor n/2 \rfloor$ and let $\lambda_1 \geq...\geq \lambda_{n} $ be adjacency eigenvalues of $G$. Then the H\"uckel energy of $G$, HE($G$), is defined as $$\he(G) = {ll} 2\sum_{i=1}^{r} \lambda_i, & \hbox{if $n= 2r$;} 2\sum_{i=1}^{r} \lambda_i + \lambda_{r+1}, & \hbox{if $n= 2r+1$.} $$ The concept of H\"uckel energy was introduced by Coulson as it gives a good approximation for the $\pi$-electron energy of molecular graphs. We obtain two upper bounds and a lower bound for HE$(G)$. When $n$ is even, it is shown that equality holds in both upper bounds if and only if $G$ is a strongly regular graph with parameters $(n, k, \lambda, \mu) = (4t^2 +4t +2, 2t^2 +3t +1, t^2 +2t, t^2 + 2t +1),$ for positive integer $t$. Furthermore, we will give an infinite family of these strongly regular graph whose construction was communicated by Willem Haemers to us. He attributes the construction to J.J. Seidel.

Affiliated with

Also associated with

No associations

Rating

Bounds for the Huckel energy of a graph 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 Bounds for the Huckel energy of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for the Huckel energy of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216032