  A hypergraph generalizes the concept of an ordinary graph. In an ordinary
graph, edges connect pairs of vertices, whereas in a hypergraph, hyperedges can
connect multiple vertices at a time. In this paper, we obtain a relationship
between the characteristic polynomial of Seidel and adjacency matrices of
hypergraph and also compute all the eigenvalues of some k-uniform hypergraphs.
Moreover, we estimate the adjacency and Seidel spectra of the uniform double
hyperstar and sunflower hypergraph. In addition to that, we determine the
Seidel spectrum and main Seidel eigenvalues of hyperstar.
