The spectrum of the Corona of Hypergraphs

The corona of hypergraphs is an extension of the corona operation applied to graphs. The corona $G_0^* \odot_1^n G_1^*$ of two hypergraphs is obtained by taking $n$ copies of $G_1^*$ (where $n$ is the order of $G_0^*$) and by joining the $i$-th vertex of $G_0^*$ with the $i$-th copy of $G_1^*$. In this paper, we estimate the complete spectrum(adjacency and Seidel) and eigenvectors of the corona $G_0^* \odot_1^n G_1^*$ of two hypergraphs when $G_1^*$ is regular. Additionally, we define the corona hypergraph $G_0^{*(m)}=G_0^{*(m-1)} \odot_1^n G_0^*$ 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.