arXiv (All)
open access
Reconstruction and Symmetry of Two-Token Graphs
We present a proof of the two-token graph reconstruction conjecture. Every finite simple graph $G,H$ of order at least three, $F_2(G) \cong F_2(H)$ if and only if $G \cong H$. We also classify the automorphism groups of two-token graphs whose connected roots have order at least five. Combining these
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
- The homomorphism threshold of odd cycle $C_{2k-1}$ is below $\frac{1}{2k-1}$#1034005
- Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes#924738
- Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes#920504
- Spread Methods for Induced Cycles#1056373
- Abelianization of Symmetric Mapping Class Groups#793804
Record · ID 1324736
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