Metraipolis › archive › dc_906bbeb02007
Perfect state transfer on unicyclic graphs — arXiv:2610.41572
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41572
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T08:18:37.502Z
- SHA-256 of the archived text
1d7090fb8dd4807c18d7c0bd0bcac5e16d611e7cc678c630a90c01a83faab087- Stable URL of this page
https://metraipolis.com/documento/dc_906bbeb02007
How to cite
Perfect state transfer on unicyclic graphs — arXiv:2610.41572 — arXiv (en), https://arxiv.org/abs/2610.41572 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_906bbeb02007 (Metraipolis archive dc_906bbeb02007, sha256 1d7090fb8dd4807c18d7c0bd0bcac5e16d611e7cc678c630a90c01a83faab087)
BibTeX
@misc{dc906bbeb02007,
title = {Perfect state transfer on unicyclic graphs — arXiv:2610.41572},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41572},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_906bbeb02007; sha256 1d7090fb8dd4807c18d7c0bd0bcac5e16d611e7cc678c630a90c01a83faab087},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41572. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We characterize adjacency perfect state transfer in connected unicyclic graphs: the transfer vertices are opposite degree-two vertices of a four-cycle, and the two attached trees satisfy a characteristic-polynomial condition. Except for the four-cycle, the transfer pair is unique and the minimum transfer time is $\pi/\sqrt2$. Outside the four-cycle, we obtain sharp lower bounds of $46$ on the order and $10$ on the maximum degree, and classify all examples of maximum degree at most $20$. A finite inverse construction enumerates all realizations of a prescribed eigenvalue support at the transfer vertices. For supports of size at least seven, we establish the sharp maximum-degree lower bound of $21$. Every seven-element support $\{0,\pm\sqrt2,\pm u\sqrt2,\pm v\sqrt2\}$, with odd integers $3\leq u<v$, is realizable, and every such realization has attachment depth at most four. Explicit branching rules give a minimum-order recurrence. Among all connected unicyclic graphs admitting perfect state transfer with seven-element eigenvalue support, the minimum order is $218$, attained uniquely up to isomorphism.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41572 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:23.781Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).