  The spectral radius (or the signless Laplacian spectral radius) of a general
hypergraph is the maximum modulus of the eigenvalues of its adjacency (or its
signless Laplacian) tensor. In this paper, we firstly obtain a lower bound of
the spectral radius (or the signless Laplacian spectral radius) of general
hypergraphs in terms of clique number. Moreover, we present a relation between
a homogeneous polynomial and the clique number of general hypergraphs. As an
application, we finally obtain an upper bound of the spectral radius of general
hypergraphs in terms of clique number.
