The trace of uniform hypergraphs with application to Estrada index
Combinatorics
2025-07-22 v1
Abstract
In this paper we investigate the traces of the adjacency tensor of hypergraphs (simply called the traces of hypergraphs). We give new expressions for the traces of hypertrees and linear unicyclic hypergraphs by the weight function assigned to their connected sub-hypergraphs, and provide some perturbation results for the traces of a hypergraph with cut vertices. As applications we determine the unique hypertree with maximum Estrada index among all hypertrees with fixed number of edges and perfect matchings, and the unique unicyclic hypergraph with maximum Estrada index among all unicyclic hypergraph with fixed number of edges and girth .
Cite
@article{arxiv.2210.03311,
title = {The trace of uniform hypergraphs with application to Estrada index},
author = {Yi-Zheng Fan and Jian Zheng and Ya Yang},
journal= {arXiv preprint arXiv:2210.03311},
year = {2025}
}