Bounds for the Energy of Hypergraphs

The concept of the energy of a graph has been widely explored in the field of mathematical chemistry and is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. The energy of a hypergraph is the trace norm of its connectivity matrices, which generalize the concept of graph energy. In this paper, we establish bounds for the adjacency energy of hypergraphs in terms of the number of vertices, maximum degree, eigenvalues, and the norm of the adjacency matrix. Additionally, we compute the sum of squares of adjacency eigenvalues of linear k-hypergraphs and derive its bounds for k-hypergraph in terms of number of vertices and uniformity of the k-hypergraph. Moreover, we determine the Nordhaus–Gaddum type bounds for the adjacency energy of k-hypergraphs.