Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be deduced from their spectra. In this paper, we show a new method for constructing cospectral uniform hypergraphs using two well-known hypergraph representations: adjacency tensors and adjacency matrices.
No takes yet. Share an insight, caveat, or question.
Abiad et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: