Metraipolis › archive › dc_6eb93a35d27e

Threshold Graphs Allow Few Distinct Eigenvalues: A New Approach — arXiv:2609.10623

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10623
License (as archived)
CC0-1.0
Archived
2026-10-16T06:13:46.133Z
SHA-256 of the archived text
5caa45acd34690c7450e6a970470d18bf782b7e8d44421163b9748751ff093a7
Stable URL of this page
https://metraipolis.com/documento/dc_6eb93a35d27e

How to cite

Threshold Graphs Allow Few Distinct Eigenvalues: A New Approach — arXiv:2609.10623 — arXiv (en), https://arxiv.org/abs/2609.10623 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6eb93a35d27e (Metraipolis archive dc_6eb93a35d27e, sha256 5caa45acd34690c7450e6a970470d18bf782b7e8d44421163b9748751ff093a7)
BibTeX
@misc{dc6eb93a35d27e,
  title = {Threshold Graphs Allow Few Distinct Eigenvalues: A New Approach — arXiv:2609.10623},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10623},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6eb93a35d27e; sha256 5caa45acd34690c7450e6a970470d18bf782b7e8d44421163b9748751ff093a7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10623. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For any graph $G$, we associate a family of real symmetric matrices, $S(G)$, where for any $A \in S(G)$, the location of the nonzero off-diagonal entries of $A$ are governed by the adjacency structure of $G$. Let $q(G)$ represent the minimum number of distinct eigenvalues over all matrices in $S(G)$. In this work, we provide an alternative technique to establish that $q(G) \leq 4$ for any threshold graph $G$ as presented in [L. Emilio Allem, C. Hoppen, J. Lazzarin, L. Siviero Sibemberg, F. Colman Tura, The minimum number of distinct eigenvalues of a threshold graph is at most 4, Linear Algebra and its Applications, 726 (2025) 32 to 53]. In addition, we show that all connected threshold graphs admit a matrix having any four distinct eigenvalues. Further

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.10623 — 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-16T05:59:08.281Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).