2024/03/05 by Liya Jess Kurian, Kurian, Liya Jess, Chithra A. V +1
Mathematics · #05C50 #05C65 #15A18 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2403.02650
openalex publication_date 2024/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The corona of hypergraphs is an extension of the corona operation applied to graphs. The corona G0^* \odot1n G1^* of two hypergraphs is obtained by taking n copies of G1^* (where n is the order of G0^*) and by joining the i-th vertex of G0^* with the i-th copy of G1^*. In this paper, we estimate the complete spectrum(adjacency and Seidel) and eigenvectors of the corona G0^* \odot1n G1^* of two hypergraphs when G1^* is regular. Additionally, we define the corona hypergraph G0*(m)=G0*(m-1) \odot1n G0^* 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.