The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
DOI10.1080/03081087.2020.1770161zbMATH Open1490.05164arXiv1803.06385OpenAlexW3028838496MaRDI QIDQ5080245FDOQ5080245
Authors: Lele Liu, Linyuan Lu
Publication date: 31 May 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.06385
Recommendations
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- On the \(\alpha \)-spectral radius of uniform hypergraphs
- \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
- On the \(\alpha\)-spectral radius of irregular uniform hypergraphs
- The \(\alpha \)-spectral radius of general hypergraphs
- The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs
- On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
- On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs
- Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Analytic methods for uniform hypergraphs
- Connected hypergraphs with small spectral radius
- Spectra of uniform hypergraphs
- Lagrangians of Hypergraphs
- A general product of tensors with applications
- Spectral extremal problems for hypergraphs
- Hypergraph theory. An introduction
- The extremal spectral radii of \(k\)-uniform supertrees
- On the principal eigenvectors of uniform hypergraphs
- Spectral radii of two kinds of uniform hypergraphs
- Some extremal problems for hereditary properties of graphs
- Extremal problems for the \(p\)-spectral radius of graphs
- Ordering uniform supertrees by their spectral radii
- The spectra of uniform hypertrees
- A bound on the spectral radius of hypergraphs with \(e\) edges
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- The first two largest spectral radii of uniform supertrees with given diameter
Cited In (3)
This page was built for publication: The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080245)