For a hypergraphG=(V,E) consisting of a nonempty vertex set
V=V(G) and an edge set E=E(G), its adjacencymatrixAGβ=[(AGβ)ijβ] is defined as
(AGβ)ijβ=βeβEijβββ£eβ£β11β, where
Eijβ={eβE:i,jβe}. The spectralradius of a hypergraph
G, denoted by Ο(G), is the maximum modulus among
all eigenvalues of AGβ. In this paper, among all
k-uniform (kβ₯3) supertrees with fixed number of vertices, the
supertrees with the maximum, the second maximum and the minimum spectral radius
are completely determined, respectively