Back to Search
Start Over
The trace of uniform hypergraphs with application to Estrada index.
- Source :
-
Discrete Mathematics, Algorithms & Applications . Jul2024, Vol. 16 Issue 5, p1-31. 31p. - Publication Year :
- 2024
-
Abstract
- In this paper, we investigate the traces of the adjacency tensor of uniform 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 present some perturbation results for the traces of a hypergraph when its structure is locally changed. As an application we determine the unique hypertree with maximum Estrada index among all hypertrees with perfect matchings and given number of edges, and the unique unicyclic hypergraph with maximum Estrada index among all unicyclic hypergraph with girth 3 and given number of edges. [ABSTRACT FROM AUTHOR]
- Subjects :
- *HYPERGRAPHS
*EIGENVALUES
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 16
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 177091164
- Full Text :
- https://doi.org/10.1142/S1793830923500659