2014/06/04 by Changjiang Bu, Jiang Zhou, Bu, Changjiang +3
Computer Science · Mathematics · #Matrix Theory and Algorithms #Tensor decomposition and applications #math.CO
paper · pdf · doi:10.48550/arxiv.1406.1085
arxiv created 2014/06/04 · arxiv updated 2014/06/05
Two k-uniform hypergraphs are said to be cospectral (E-cospectral), if their adjacency tensors have the same characteristic polynomial (E-characteristic polynomial). A k-uniform hypergraph H is said to be determined by its spectrum, if there is no other non-isomorphic k-uniform hypergraph cospectral with H. In this note, we give a method for constructing E-cospectral hypergraphs, which is similar with Godsil-McKay switching. Some hypergraphs are shown to be determined by their spectra.