Note for Nikiforov's two conjectures on the energy of trees
Combinatorics
2009-06-05 v1
Abstract
The energy of a graph is defined to be the sum of the absolute values of its eigenvalues. Nikiforov in {\it ``V. Nikiforov, The energy of -free graphs of bounded degree, Lin. Algebra Appl. 428(2008), 2569--2573"} proposed two conjectures concerning the energy of trees with maximum degree . In this short note, we show that both conjectures are true.
Keywords
Cite
@article{arxiv.0906.0827,
title = {Note for Nikiforov's two conjectures on the energy of trees},
author = {Xueliang Li and Jianxi Liu},
journal= {arXiv preprint arXiv:0906.0827},
year = {2009}
}
Comments
5 pages