On the spectral radii of the unicyclic hypergraphs with fixed matching number
Abstract
We determine the unique hypergraphs with maximum spectral radius among all connected k-uniform (k≥ 3) unicyclic hypergraphs with matching number at least z, and among all connected k-uniform (k≥ 3) unicyclic hypergraphs with a given matching number, respectively.
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.