  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.
