Ordering Bipartite Graphs by their Minimal Energies

The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Let be the class of connected bipartite graphs with exactly two vertex-disjoint cycles. The graphs with minimal energies in is determined by [18]. In this paper, we determine the second to sixth graphs with minimal energy in the above ordering.