Spectra of general hypergraphs

详细信息    查看全文

• 作者：Anirban Banerjee^a ; ^b ; ^{anirban.banerjee@iiserkol.ac.in} ; Arnab Char^a ; ^{ac13ms134@iiserkol.ac.in} ; Bibhash Mondal^a ; ^{bm12ip022@iiserkol.ac.in}
• 关键词：05C65 ; 15A18
• 刊名：Linear Algebra and its Applications
• 出版年：2017
• 出版时间：1 April 2017
• 年：2017
• 卷：518
• 期：Complete
• 页码：14-30
• 全文大小：365 K
• 卷排序：518

文摘

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.