Indexed by：
Abstract：
The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. Let Τn denote the set of trees with n vertices. When n ≥ 6, for a given integer Δε[3,n-2], we characterize the tree in Τn with maximum degree Δ and maximal energy. Furthermore, for ⌈n+1/3⌉ ≤ Δ(T) ≤ n - 2 and n ≥ 1, the tree in Τn with maximum degree Δ and minimal energy is also determined.
Keyword：
Reprint 's Address：
Email：
Source ：
Match
ISSN： 0340-6253
Year： 2005
Issue： 2
Volume： 54
Page： 363-378
0 . 8 2 8
JCR@2005
2 . 9 0 0
JCR@2023
ESI Discipline： CHEMISTRY;
JCR Journal Grade：2
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
