Bounds on the A_ -spectral radius of uniform hypergraphs with some vertices deleted

For a positive integer \(k\geq 2\), a \(k\)-uniform hypergraph \(G\) is a pair consisting of a vertex set \(V(G)=[n]\) and a set \(E(G)\) with \(|e|=k\) for every \(e\in E(G)\). Let \(D(G)\) and \(A(G)\) be the diagonal and adjacency tensors of a \(k\)-uniform hypergraph \(G\), respectively. The \(A_{\alpha}\)-spectral radius of \(G\) is defined as the spectral radius of the tensor \(A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)\), where \(0\leq\alpha<1\). In the paper, the authors establish a novel interlacing inequality and then explore its applications in spectral hypergraph theory. More precisely, an interlacing inequality for the spectral radius of a principal subtensor of a nonnegative weakly irreducible symmetric tensor is obtained first. Then, for a connected \(k\)-uniform hypergraph \(G\) with vertex set \([n]\) and a subset \(S\) of \([n]\), they establish a relationship between the \(A_{\alpha}\)-spectral radius of \(G\) and \(G-S\). Subsequently, several upper bounds on the entry of the principal eigenvector of \(G\) associated with \(\rho_{\alpha}(G)\) are derived in different ways. Based on above, when \(S=\{s\}\), they present a sharp lower bound of \(\rho_{\alpha}(G-s)\) in terms of the \(A_{\alpha}\)-spectral radius \(\rho_{\alpha}(G)\), the vertex degree \(d_{s}\) and the co-degree, which generalizes some known results in [\textit{H. Lin} et al., ``Largest and least H-eigenvalues of symmetric tensors and hypergraphs, Preprint, \url{arXiv:2306.14244}].

Cites work

This page was built for publication: Bounds on the \(\mathcal{A}_\alpha \)-spectral radius of uniform hypergraphs with some vertices deleted

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982352)