arXiv (All)
open access
Almost all graphs are determined by their generalized spectrum
Haemers' conjecture for the generalized spectrum asserts that almost all graphs are determined by their generalized spectrum, that is, for almost all graphs $G$, every graph with the same spectrum as $G$ whose complement has the same spectrum as the complement of $G$ is isomorphic to $G$. We prove t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distinguishing graphs with simple spectrum by homomorphism counts#1233081
- Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms#268172
- Optimization Inverse Spectral Problem for the Schrödinger Operator on a Compact Graph#1343273
- Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs#794069
- Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs#790050
Record · ID 1247974
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive