Abstract
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 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
