Xueliang Li, Jianxi Liu
Published 2009-06-04Version 1
The energy $E$ of a graph is defined to be the sum of the absolute values of its eigenvalues. Nikiforov in {\it ``V. Nikiforov, The energy of $C_4$-free graphs of bounded degree, Lin. Algebra Appl. 428(2008), 2569--2573"} proposed two conjectures concerning the energy of trees with maximum degree $\Delta\leq 3$. In this short note, we show that both conjectures are true.
All Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices
A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ\leq 3$
Hypoenergetic and strongly hypoenergetic trees
![QR code for arXiv:0906.0827 [math.CO]](http://oss.arxitics.com/images/favicon.svg)