The trace and Estrada index of uniform hypergraphs with cut vertices

Abstract

Let $\mathcal{H}$ be an $m$-uniform hypergraph, and let $\mathcal{A}(\mathcal{H})$ be the adjacency tensor of $\mathcal{H}$ which can be viewed as a system of homogeneous polynomials of degree $m-1$. Morozov and Shakirov generalized the traces of linear systems to nonlinear homogeneous polynomial systems and obtained explicit formulas for multidimensional resultants. Sun, Zhou and Bu introduced the Estrada index of uniform hypergraphs which is closely related to the traces of their adjacency tensors. In this paper we give formulas for the traces of $\mathcal{A}(\mathcal{H})$ when $\mathcal{H}$ contains cut vertices, and obtain results on the traces and Estrada index when $\mathcal{H}$ is perturbed under local changes. We prove that among all hypertrees with fixed number of edges, the hyperpath is the unique one with minimum Estrada index and the hyperstar is the unique one with maximum Estrada index.

References in corpus (7)

• Subgraph Centrality in Complex Networks
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• 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

Cited by in corpus (2)

• High-ordered spectral characterization of unicyclic graphs
• The trace of uniform hypergraphs with application to Estrada index