摘要

The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. We determine the tree(s) with minimal energy in the class of trees of a (p, q)-bipartition and diameter d, where q >= p >= left perpendiculard 1/2right perpendicular >= 2.