The second largest spectral radii of uniform hypertrees with given size of matching

DOI10.1080/03081087.2019.1693954zbMath1472.05120OpenAlexW2991544094MaRDI QIDQ4959335

Li Su, Erfang Shan, Hong-Hai Li, Li-ying Kang

Publication date: 13 September 2021

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

Full work available at URL: https://doi.org/10.1080/03081087.2019.1693954

zbMATH Keywords

hypergrapheigenvaluesmatchingmatching polynomialadjacency tensorhypertree

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter ⋮ The hypertree with the largest spectral radius among all hypertrees with given size and stability number

Cites Work

• Connected hypergraphs with small spectral radius
• The extremal spectral radii of \(k\)-uniform supertrees
• Spectra of uniform hypergraphs
• Bounds on the largest eigenvalues of trees with a given size of matching
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Hypergraph theory. An introduction
• The matching polynomials and spectral radii of uniform supertrees
• The maximum spectral radii of uniform supertrees with given degree sequences
• The spectra of uniform hypertrees
• The first two largest spectral radii of uniform supertrees with given diameter
• A general product of tensors with applications
• Eigenvalues of a real supersymmetric tensor
• The largest spectral radius of uniform hypertrees with a given size of matching
• Tensor Analysis
• Ordering of some uniform supertrees with larger spectral radii

This page was built for publication: The second largest spectral radii of uniform hypertrees with given size of matching