Lower bounds for the A_-spectral radius of uniform hypergraphs

From MaRDI portal
Publication:2238876




Abstract: For 0leqalpha<1, the mathcalAalpha-spectral radius of a k-uniform hypergraph G is defined to be the spectral radius of the tensor mathcalAalpha(G):=alphamathcalD(G)+(1alpha)mathcalA(G), where mathcalD(G) and A(G) are diagonal and the adjacency tensors of G respectively. This paper presents several lower bounds for the difference between the mathcalAalpha-spectral radius and an average degree frackmn for a connected k-uniform hypergraph with n vertices and m edges, which may be considered as the measures of irregularity of G. Moreover, two lower bounds on the mathcalAalpha-spectral radius are obtained in terms of the maximum and minimum degrees of a hypergraph.









This page was built for publication: Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs

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