{
  "id": "2411.13229",
  "version": "v1",
  "published": "2024-11-20T11:43:04.000Z",
  "updated": "2024-11-20T11:43:04.000Z",
  "title": "On cospectral graphons",
  "authors": [
    "Jan Hladký",
    "Daniel Iľkovič",
    "Jared León",
    "Xichao Shu"
  ],
  "comment": "7 pages",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-11-20T11:43:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cospectral graphons",
      "cospectral graphs",
      "graph case",
      "cut distance",
      "short note"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}