E-cospectral hypergraphs and some hypergraphs determined by their spectra
classification
🧮 math.CO
keywords
hypergraphsdeterminede-cospectraluniformcospectralhypergraphpolynomialsaid
pith:TXV7JRBP Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{TXV7JRBP}
Prints a linked pith:TXV7JRBP badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.