The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

Abstract

Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $\mathcal{A}(G)$ be the adjacency tensor of $G$. The least H-eigenvalue of $\mathcal{A}(G)$ refers to the least real eigenvalue of $\mathcal{A}(G)$ associated with a real eigenvector. In this paper we obtain a perturbation result on the least H-eigenvalue of $\mathcal{A}(G)$ when a branch of $G$ attached at one vertex is relocated to another vertex, and characterize the unique hypergraph whose least H-eigenvalue attains the minimum among all hypergraphs in a certain class of hypergraphs which contain a fixed connected hypergraph.

arXiv commentarXiv admin note: substantial text overlap with arXiv:1902.04233

References in corpus (9)

• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph
• 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
• The $H$-spectrum of a generalized power hypergraph
• Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs
• Eigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue
• The largest $H$-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs