Metraipolis › archive › dc_79dc9dab33f7

Graphs with three distinct distance eigenvalues, one of which is zero — arXiv:2611.00126

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00126
License (as archived)
CC0-1.0
Archived
2026-11-03T18:49:18.601Z
SHA-256 of the archived text
bf945dc13281b0c4ff3ee14dd6008d06eebd3c4b4e544ed603bb4072693e4d50
Stable URL of this page
https://metraipolis.com/documento/dc_79dc9dab33f7

How to cite

Graphs with three distinct distance eigenvalues, one of which is zero — arXiv:2611.00126 — arXiv (en), https://arxiv.org/abs/2611.00126 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_79dc9dab33f7 (Metraipolis archive dc_79dc9dab33f7, sha256 bf945dc13281b0c4ff3ee14dd6008d06eebd3c4b4e544ed603bb4072693e4d50)
BibTeX
@misc{dc79dc9dab33f7,
  title = {Graphs with three distinct distance eigenvalues, one of which is zero — arXiv:2611.00126},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00126},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_79dc9dab33f7; sha256 bf945dc13281b0c4ff3ee14dd6008d06eebd3c4b4e544ed603bb4072693e4d50},
  year = {2026}
}

Archived text

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

Koolen, Hayat and Iqbal asked for the connected graphs whose distance matrix has exactly three distinct eigenvalues, the middle one being $0$. The examples they gave, namely the Johnson graphs, the Hamming graphs and the halved cubes, are distance-regular. In this note, we show that the distance spectrum of such a graph is $\{\rho,0,-c\}$ with integers $c\ge2$ and $c\mid\rho$. For $c=2$ the graphs are exactly the cocktail party graphs, and for $c=3$ they are exactly the Cartesian product $K_3\,\square\,K_3$ of two triangles, the Petersen graph and its complement. We also show that such a graph need not be transmission-regular: Seidel switching the lattice graph $K_6\,\square\,K_6$ with respect to a line and the triangular graph $T(11)$ with respect to a maximal clique of size $10$ gives graphs on $36$ and $55$ vertices with distance spectra $\{54,0^{(26)},(-6)^{(9)}\}$ and $\{81,0^{(45)},(-9)^{(9)}\}$. Among the graphs of diameter $2$ obtained by switching a strongly regular graph with smallest eigenvalue $-2$ with respect to one part of an equitable partition, these two are the only ones that have exactly three distance eigenvalues and are not transmission-regular. We also observe that the transmission-regular graphs with exactly three distinct distance eigenvalues, the smallest one being $-3$, are exactly the complements of the strongly regular graphs with smallest eigenvalue $-2$ other than the cocktail party graphs.

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/2611.00126 — 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-03T18:15:38.036Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).