arXiv · 1601.02136
Spectra of general hypergraphs
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.
Explore related subjects
Keep this discovery
Anirban Banerjee, Arnab Char, Bibhash Mondal. 2016-01-09. Spectra of general hypergraphs. https://doi.org/10.1016/j.laa.2016.12.022
Cite the original work for its findings. Save a collection to share your selection of sources.