Kauê Cardoso, Renata Del-Vecchio, Lucas Portugal, Vilmar Trevisan
Published 2021-06-13Version 1
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 divied. In addition, we solved the extremal problem energy for the class of hyperstars, and show that the energy of a hypergraph is never an odd number.
On $α$-adjacency energy of graphs and Zagreb index
Edge-vertex degree based Zagreb index and graph operations
Odd-Sunflowers
![QR code for arXiv:2106.07042 [math.CO]](http://oss.arxitics.com/images/favicon.svg)