{
  "abstract": "Let $G$ be a graph with adjacency matrix $A$ and degree matrix $D$. Applying $A$ and $D$ repeatedly to the all-ones vector produces a space $M_G$ of functions on the vertices, and these functions are constant on the orbits of the automorphism group. We call $G$ AD-observable if $M_G$ contains the indicator vector of every orbit, and AD-separable if the functions in $M_G$ separate the orbits. Forests are AD-observable, by McKay's leaf-pruning argument. Our main result is that for every cograph, $M_G$ is spanned by the indicator vectors of the cells of the stable partition of color refinement. Hence a cograph is AD-observable, or equivalently AD-separable, exactly when color refinement finds its orbits, and we describe these cographs by their cotrees. We also show that two cographs with the same number of vertices and the same homomorphism counts from all caterpillars have the same counts from all trees. The main result does not extend to distance-hereditary graphs: we give two such graphs on nine vertices that are AD-separable but not AD-observable.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.21494",
  "author_total": 2,
  "authors": [
    {
      "name": "Zhipeng Lu"
    },
    {
      "name": "Pengxiang Li"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/f3bedqw20qdzn.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.21494",
  "fulltext_url": null,
  "id": "f3bedqw20qdzn",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.21494",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.SP"
    ],
    [
      "openalex",
      "2608|Graph theory and applications"
    ]
  ],
  "openalex": "W7170662189",
  "pdf_url": "https://arxiv.org/pdf/2607.21494",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-05",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/f3bedqw20qdzn.ris",
  "sources": [
    {
      "first_seen": "2026-11-06T18:21:34Z",
      "native_id": "2607.21494",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.21494"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.SP",
      "subfield": "analysis-pdes"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Adjacency-degree algebras and spectral determination of graphs",
  "title_text": "Adjacency-degree algebras and spectral determination of graphs",
  "type": "preprint",
  "updated_at": "2026-11-09T00:20:42Z",
  "url": "https://research.draconitic.com/paper/f3bedqw20qdzn",
  "venue": "arXiv",
  "versions": []
}