Spectra of general hypergraphs
Spectral Theory
2017-01-24 v4 Combinatorics
Numerical Analysis
Abstract
Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these properties are similar for graphs and uniform hypergraphs. The representation of a connectivity hypermatrix that is proposed here can be very useful for the further development in spectral hypergraph theory.
Cite
@article{arxiv.1601.02136,
title = {Spectra of general hypergraphs},
author = {Anirban Banerjee and Arnab Char and Bibhash Mondal},
journal= {arXiv preprint arXiv:1601.02136},
year = {2017}
}
Comments
This paper is already online available at Linear algebra and its application