E-cospectral hypergraphs and some hypergraphs determined by their spectra
Combinatorics
2014-06-05 v1
Abstract
Two -uniform hypergraphs are said to be cospectral (E-cospectral), if their adjacency tensors have the same characteristic polynomial (E-characteristic polynomial). A -uniform hypergraph is said to be determined by its spectrum, if there is no other non-isomorphic -uniform hypergraph cospectral with . 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.
Cite
@article{arxiv.1406.1085,
title = {E-cospectral hypergraphs and some hypergraphs determined by their spectra},
author = {Changjiang Bu and Jiang Zhou and Yimin Wei},
journal= {arXiv preprint arXiv:1406.1085},
year = {2014}
}