On Cospectral Graphons

  • Jan Hladký
  • Daniel Iľkovič
  • Jared León
  • Xichao Shu

Abstract

In this short note, we study the notion of 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.

Published
2026-01-09
How to Cite
Hladký, J., Iľkovič, D., León, J., & Shu, X. (2026). On Cospectral Graphons. The Electronic Journal of Combinatorics, 33(1), P1.10. https://doi.org/10.37236/13768
Article Number
P1.10