Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices (Q777090): Difference between revisions

Let \(G\) be a connected hypergraph with even uniformity, which contains cut vertices. Let \(\mathscr{A} (G)\) be the adjacency tensor of \(G\). The least H-eigenvalue of \(\mathscr{A} (G)\) refers to the least real eigenvalue of \(\mathscr{A} (G)\) associated with a real eigenvector. In this paper, the authors obtain a perturbation result for the least H-eigenvalue of \(\mathscr{A} (G)\) when a branch of \(G\) attached at one vertex is relocated to another vertex, and they 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. The perturbation result in this paper is a generalization of that on the least eigenvalue of the adjacency matrix of a simple graph in [\textit{Y.-Z. Fan} et al., Linear Algebra Appl. 429, No. 2--3, 577--588 (2008; Zbl 1143.05053)].