arrow
Return

On cospectral graphons

delete2026-01-09
delete0
PRE
AI
H
Hladky, Jan *
I
Il'kovic, Daniel
L
Leon, Jared
S
Shu, Xichao
DOI:10.37236/13768delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
ISOMORPHISM

Journal

E
ELECTRONIC JOURNAL OF COMBINATORICS
IF:
0.7
Papers:
173
Citations:
0

Organization

C
Czech Academy of Sciences
Scholars:
2.6K
Papers: 1.0K
Citations: 4.4W
L
leipzig university
Scholars:
1.8K
Papers: 725
Citations: 0
researcher View more organizations