The largest spectral radius of uniform hypertrees with a given size of matching
classification
🧮 math.CO
keywords
hypertreesmatchinggivenlargestradiussizespectraldetermine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.