Adjacency Energy of Hypergraphs
Combinatorics
2021-06-15 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2106.07042,
title = {Adjacency Energy of Hypergraphs},
author = {Kauê Cardoso and Renata Del-Vecchio and Lucas Portugal and Vilmar Trevisan},
journal= {arXiv preprint arXiv:2106.07042},
year = {2021}
}