The maximal spectral radius of the uniform unicyclic hypergraph with perfect matchings

Abstract

Let $\mathcal{U}(n,k)$ and $\hat{I}“(n,k)$ be the set of the $k$-uniform linear and nonlinear unicyclic hypergraphs having perfect matchings with $n$ vertices respectively, where $n\ge k(k-1)$ and $k\ge 3$. By using some techniques of transformations and constructing the incidence matrices for the hypergraphs considered, we get the hypergraphs with the maximal spectral radii among three kinds of hypergraphs, namely $\mathcal{U}(n,k)$ with $n=2k(k-1)$ and $n\ge 9k(k-1)$, $\hat{I}“(n,k)$ with $n\ge k(k-1)$, and $\mathcal{U}(n,k)\cup \hat{I}“(n,k)$ with $n\ge 2k(k-1)$, where $k\ge 3$.