Lower bounds for the A_-spectral radius of uniform hypergraphs

DOI10.1016/J.LAA.2021.08.021zbMATH Open1476.05131arXiv2109.03507OpenAlexW3197284834MaRDI QIDQ2238876FDOQ2238876

Authors: Peng-Li Zhang, Xiao-Dong Zhang 

Publication date: 2 November 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: For $0leqalpha<1$, the $mathcal{A}_{alpha}$-spectral radius of a $k$-uniform hypergraph $G$ is defined to be the spectral radius of the tensor $mathcal{A}_{alpha}(G):=alphamathcalD(G)+(1-alpha)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 $mathcal{A}_{alpha}$-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 $mathcal{A}_{alpha}$-spectral radius are obtained in terms of the maximum and minimum degrees of a hypergraph.

Full work available at URL: https://arxiv.org/abs/2109.03507

Recommendations

• On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
• New bounds for the spectral radius of uniform hypergraphs

zbMATH Keywords

tensorspectral radiusuniform hypergraphvertex degree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hypergraphs (05C65)

Cites Work

• Eigenvalues of a real supersymmetric tensor
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Spectra of uniform hypergraphs
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
• On spectral hypergraph theory of the adjacency tensor
• The Kronecker Product of Graphs
• Symmetric nonnegative tensors and copositive tensors
• Spektren endlicher Grafen
• A general product of tensors with applications
• Large matchings from eigenvalues
• Analytic connectivity of \(k\)-uniform hypergraphs
• Merging the \(A\)- and \(Q\)-spectral theories
• Hypergraphs and hypermatrices with symmetric spectrum
• Bounds on the spectral radius of uniform hypergraphs
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
• On the number of independent sets in simple hypergraphs
• On the signless Laplacian spectral radius of irregular graphs
• Some properties and applications of odd-colorable \(r\)-hypergraphs
• On the irregularity of uniform hypergraphs
• On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
• On the spectral radii and principal eigenvectors of uniform hypergraphs
• The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number

Cited In (8)

• On the \(A_\alpha \)-spectral radius of graphs with given size and diameter
• The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
• On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
• A lower bound for the spectral radius of complex matrices
• \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
• The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
• Ordering of graphs with fixed size and diameter by A _α -spectral radii
• The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number

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)