Spectral radius and matching number of the unicyclic hypergraph

In this paper, among all k-uniform (k≥3) unicyclic hypergraphs of order n and with matching number at least z (z is an integer satisfying 1≤z≤nk−1−1), and among all k-uniform (k≥3) unicyclic hypergraphs of order n and with a given matching number, the hypergraphs with the maximum spectral radius are completely determined, respectively.