The largest spectral radius of uniform hypertrees with a given size of matching

2018/10/15 by Su, Li, Kang, Liying, Li, Honghai +1
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1810.06139

Abstract

In this paper, using the theory of matching polynomial of hypertrees and ordering of hypertrees, we determine the largest spectral radius of hypertrees with m edges and given size of matching.

Related

• The distance spectral radius of k-uniform hypertrees with given number of vertices of maximum degree
• On some properties of the α-spectral radius of the k-uniform hypergraph
• The matching polynomials and spectral radii of uniform supertrees
• The algebraic multiplicity of the spectral radius of a hypertree
• The extremal spectral radii of k-uniform supertrees