Metraipolis › archive › dc_5e1f2bb419d5
Spectral asymmetry and odd cycles in integral graphs — arXiv:2610.22773
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22773
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:39:19.344Z
- SHA-256 of the archived text
dfc78e413353bd230e56c1d9368a606f60c8930f37b737a000a2880390b9e189- Stable URL of this page
https://metraipolis.com/documento/dc_5e1f2bb419d5
How to cite
Spectral asymmetry and odd cycles in integral graphs — arXiv:2610.22773 — arXiv (en), https://arxiv.org/abs/2610.22773 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5e1f2bb419d5 (Metraipolis archive dc_5e1f2bb419d5, sha256 dfc78e413353bd230e56c1d9368a606f60c8930f37b737a000a2880390b9e189)
BibTeX
@misc{dc5e1f2bb419d5,
title = {Spectral asymmetry and odd cycles in integral graphs — arXiv:2610.22773},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22773},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5e1f2bb419d5; sha256 dfc78e413353bd230e56c1d9368a606f60c8930f37b737a000a2880390b9e189},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22773. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that the triangle $C_3$ is the only integral unicyclic graph with an odd cycle. The main tool is a spectral inequality that does not require integrality: if $G$ is a connected non-bipartite graph and $G-e$ is bipartite for some edge $e$, then the eigenvalues $\lambda_1\ge\cdots\ge\lambda_n$ of $G$ satisfy $\sum_{i}(\lambda_i+\lambda_{n+1-i})^+\le 2$ and $0<\lambda_1+\lambda_n\le 1$. It follows from comparing $A(G)$ with the signed adjacency matrix obtained by reversing the sign of $e$, which is similar to $-A(G)$, through a common rank-one perturbation and Weyl's monotonicity theorem. For integral graphs in this class, an arithmetic lemma then gives $\lambda_n=1-\lambda_1$ and at least $\lambda_1-1\ge1$ triangles, which yields the classification. We also prove that an integral graph of odd girth $g$ has at least $(g-1)!/2$ cycles of length $g$, with equality for the Petersen graph when $g=5$, and we derive consequences for quantum periodicity a
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.22773 — 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-10-19T09:34:59.726Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).