  The spectral radius of a uniform hypergraph is defined to be that of the
adjacency tensor the hypergraph. It is known that the unique unicyclic
hypergraph with the largest spectral radius is a nonlinear hypergraph, and the
unique linear unicyclic hypergraph with the largest spectral radius is a power
hypergraph. In this paper we determine the the unique linear unicyclic
hypergraph with the second or third largest spectral radius, where the former
hypergraph is a power hypergraph and the latter hypergraph is a non-power
hypergraph.
