Joins of Hypergraphs and Their Spectra

12/30/2019

∙

by   Amitesh Sarkar, et al.

∙

Indian Institute of Science Education and Research, kolkata

∙

0

∙

share

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the characteristics polynomial of a complete m-uniform m-partite hypergraph K^m_n_1,n_2,...,n_m. Studying edge corona of hypergraphs we find the complete spectrum of s-loose cycles C^m_L(s;n) for m ≥ 2s+1 and the characteristics polynomial of a s-loose paths P^(m)_L(s;n). Some of the eigenvalues of P^(m)_L(s;n) are also derived. Moreover, using vertex corona, we show how to generate infinitely many pairs of non-isomorphic co-spectral hypergraphs.