Arnab Char

Anirban Banerjee, Arnab Char, Bibhash Mondal

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.

Anirban Banerjee, Arnab Char

Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform hypergraphs. Our representation of a connectivity tensor will be very useful for the further development in spectral theory of directed hypergraphs. At the end, we have also introduced the concept of weak* irreducible hypermatrix to better explain connectivity of a directed hypergraph.