The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs

DOI10.1080/03081087.2020.1770161zbMath1490.05164arXiv1803.06385OpenAlexW3028838496MaRDI QIDQ5080245

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

zbMATH Keywords

uniform hypergraphweighted incidence matrix\(p\)-spectral radius\( \alpha \)-normal labelling

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Some properties of the p-spectral radius on tensors for general hypergraphs and their applications

Cites Work

• Connected hypergraphs with small spectral radius
• The extremal spectral radii of \(k\)-uniform supertrees
• On the principal eigenvectors of uniform hypergraphs
• Some extremal problems for hereditary properties of graphs
• Extremal problems for the \(p\)-spectral radius of graphs
• Spectra of uniform hypergraphs
• Ordering uniform supertrees by their spectral radii
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• A bound on the spectral radius of hypergraphs with \(e\) edges
• Hypergraph theory. An introduction
• Analytic methods for uniform hypergraphs
• Spectral radii of two kinds of uniform hypergraphs
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The spectra of uniform hypertrees
• The first two largest spectral radii of uniform supertrees with given diameter
• A general product of tensors with applications
• Lagrangians of Hypergraphs
• Spectral Extremal Problems for Hypergraphs

This page was built for publication: The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs