On cospectral graphons
Combinatorics
2024-11-21 v1
Abstract
In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectra, by equality of cycle densities, and by a unitary transformation. We also give an example of two cospectral graphons that cannot be approximated by two sequences of cospectral graphs in the cut distance.
Cite
@article{arxiv.2411.13229,
title = {On cospectral graphons},
author = {Jan Hladký and Daniel Iľkovič and Jared León and Xichao Shu},
journal= {arXiv preprint arXiv:2411.13229},
year = {2024}
}
Comments
7 pages