The trace of uniform hypergraphs with application to Estrada index

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$.

References in corpus (7)

• Subgraph Centrality in Complex Networks
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Maximizing spectral radii of uniform hypergraphs with few edges
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs
• The cyclic index of adjacency tensor of generalized power hypergraphs
• The trace and Estrada index of uniform hypergraphs with cut vertices