Minimal energy trees of given bipartition and diameter

Abstract

The energy of a graph is defined as the sum of the absolute values of nil 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 ≥ [d+1÷2]≥ 2.