The spectrum of the Corona of Hypergraphs

The corona of hypergraphs is an extension of the corona operation applied to graphs. The corona G₀^* ₁ⁿ G₁^* of two hypergraphs is obtained by taking n copies of G₁^* (where n is the order of G₀^*) and by joining the i-th vertex of G₀^* with the i-th copy of G₁^*. In this paper, we estimate the complete spectrum (adjacency and Seidel) and eigenvectors of the corona G₀^* ₁ⁿ G₁^* of two hypergraphs when G₁^* is regular. Additionally, we define the corona hypergraph G₀^* (m) =G₀^* (m-1) ₁ⁿ G₀^* and determined its adjacency spectrum. Also, we extend the definition coronal of the adjacency matrix. Moreover, we estimate the characteristic polynomial of Seidel matrix of the generalised corona of hypergraphs. Applying these results, we obtain infinitely many non-regular non-isomorphic adjacency and Seidel cospectral hypergraphs.