Bounds on the spectral radius of general hypergraphs in terms of clique number (Q2228103)

\textit{L. Qi} [J. Symb. Comput. 40, No. 6, 1302--1324 (2005; Zbl 1125.15014); Commun. Math. Sci. 12, No. 6, 1045--1064 (2014; Zbl 1305.05134)] and \textit{L. H. Lim} [in: Proceedings of the 1st IEEE international workshop on computational advances of multitensor adative processing. Piscataway, NJ: IEEE. 129--132 (2005; doi:10.1109/CAMAP.2005.1574201)] started investigating the abstraction of tensor eigenvalues and spectra of tensors. The present authors derive a bound on the signless Laplacian spectral radius of general hypergraphs in terms of the clique number. Further, they establish a connection between homogeneous polynomials and clique numbers of general hypergraphs. Then they derive a lower and an upper bound on the spectral radius of general hypergraphs in terms of clique number, respectively.