Abstract
The energy \( \mathcal{E}(G) \) of a graph \( G \) is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. If the energy of a graph \( G \) of order \( n \) is equal to its order, then \( G \) is said to be orderenergetic.
In this paper, we give two methods to construct orderenergetic graphs. Infinitely many connected non-complete multipartite orderenergetic graphs can be constructed by using regular graphs.
