Joins of hypergraphs and their spectra

From MaRDI portal
Publication:2197129

DOI10.1016/J.LAA.2020.05.029zbMATH Open1451.05146arXiv1912.12921OpenAlexW3030016627MaRDI QIDQ2197129FDOQ2197129

Amitesh Sarkar, Anirban Banerjee

Publication date: 28 August 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: 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 Kn1,n2,dots,nmm. Studying edge corona of hypergraphs we find the complete spectrum of s-loose cycles CL(s;n)m for mgeq2s+1 and the characteristics polynomial of a s-loose paths PL(s;n)(m). Some of the eigenvalues of PL(s;n)(m) are also derived. Moreover, using vertex corona, we show how to generate infinitely many pairs of non-isomorphic co-spectral hypergraphs.


Full work available at URL: https://arxiv.org/abs/1912.12921




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Joins of hypergraphs and their spectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197129)