The energy \( \mathcal{E}(G) \) of a graph \( G \) is the sum of the absolute values of all the eigenvalues of its adjacency matrix. Gutman (2001) pointed out a problem to characterize the graph \( G \) and the edge \( e \) of \( G \) such that \( \mathcal{E}(G - e) \leqslant \mathcal{E}(G) \). Tang et al.\ (2023) gave a sufficient condition for \( \mathcal{E}(G - e) \leqslant \mathcal{E}(G) \), where \( e \) is not necessarily a cut-edge set or a cut edge. We deduce here a stronger conclusion than the results obtained by Tang et al. (2023). Our findings cover some known conclusions, such as the results obtained by Gutman and Pavlović (1999) and Tang et al. (2023). In addition, based on the new results we obtained in this article, we can directly conclude that adding edges to a complete \( k \)-partite graph leads to a graph with a higher energy than the energy of the original graph.