  In this paper, we define a homogeneous polynomial for a general hypergraph,
and establish a remarkable connection between clique number and the homogeneous
polynomial of a general hypergraph. For a general hypergraph, we explore some
inequality relations among spectral radius, clique number and the homogeneous
polynomial. We also give lower and upper bounds on the spectral radius in terms
of the clique number.
