Numerous graph energies of regular subdivision graph and complete graph

The graph energy E(G) of a simple graph G is sum of its absolute eigenvalues where eigenvalues of adjacency matrix A(G) are referred as eigenvalues of graph G. Depends upon eigenvalues of different graph matrices, several graph energies has been observed recently such as maximum degree energy, Randic ' energy, sum-connectivity energy etc. Depending on the definition of a graph matrix, the graph energy can be easily determined. This article contains upper bounds of several graph energies of s-regular subdivision graph S (G). Also various graph energies of complete graph are mentioned in this article.