Back to Search
Start Over
The trace of uniform hypergraphs with application to Estrada index
- Publication Year :
- 2022
-
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 $3$.
- Subjects :
- Mathematics - Combinatorics
Primary 05C65, 15A69, Secondary 13P15, 14M99
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2210.03311
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1142/S1793830923500659