Adjacency energy of hypergraphs

In this paper, we define and obtain several properties of the (adjacency) energy of a hypergraph. In particular, bounds for this energy are obtained as functions of structural and spectral parameters, such as Zagreb index and spectral radius. We also study how the energy of a hypergraph varies when a vertex/edge is removed or when an edge is divided. In addition, we solve the extremal problem energy for the class of hyperstars, and show that the energy of a hypergraph is never an odd number.