The algebraic multiplicity of the spectral radius of a hypertree

2023/06/29 by Chen, Lixiang, Bu, Changjiang
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2306.16771

Abstract

It is well-known that the spectral radius of a connected uniform hypergraph is an eigenvalue of the hypergraph. However, its algebraic multiplicity remains unknown. In this paper, we use the Poisson Formula and matching polynomials to determine the algebraic multiplicity of the spectral radius of a uniform hypertree.

Related

• The largest spectral radius of uniform hypertrees with a given size of matching
• On some properties of the α-spectral radius of the k-uniform hypergraph
• On the α-spectral radius of the k-uniform supertrees
• The distance spectral radius of k-uniform hypertrees with given number of vertices of maximum degree
• The multiplicity of the zero Laplacian eigenvalue of uniform hypertrees