A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ\leq 3$

Xueliang Li, Hongping Ma

Published 2009-06-15, updated 2009-06-16Version 2

The energy $E(G)$ of a graph $G$ is defined as the sum of the absolute values of its eigenvalues. A graph $G$ of order $n$ is said to be hypoenergetic if $E(G)<n$. Majstorovi\'{c} et al. conjectured that complete bipartite graph $K_{2,3}$ is the only hypoenergetic connected quadrangle-containing graph with maximum degree $\Delta \leq 3$. This paper is devoted to giving a confirmative proof to the conjecture.