REVIEW
E-cospectral hypergraphs and some hypergraphs determined by their spectra
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
E-cospectral hypergraphs and some hypergraphs determined by their spectra
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 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.