Indexed by：
Abstract：
The energy E (G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n-vertex graph G is said to be hypoenergetic if E(G) ＜ n. In Gutman et al. (2008) [14] the authors conjectured that there exist n-vertex hypoenergetic trees with maximum degree Delta = 4 for any n 2 mod 4, n ＞ 2. In this paper we confirm this conjecture. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
APPLIED MATHEMATICS LETTERS
ISSN： 0893-9659
Year： 2010
Issue： 4
Volume： 23
Page： 484-486
1 . 1 5 5
JCR@2010
2 . 9 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
JCR Journal Grade：2
CAS Journal Grade：3
Cited Count：
SCOPUS Cited Count： 1
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
