The largest spectral radius of uniform hypertrees with a given size of matching
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.