English

Spectral characterizations of anti-regular graphs

Combinatorics 2019-12-11 v2

Abstract

We study the eigenvalues of the unique connected anti-regular graph AnA_n. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an almost complete characterization of the eigenvalues. In particular, we show that the interval Ω=[122,1+22]\Omega=[\tfrac{-1-\sqrt{2}}{2}, \tfrac{-1+\sqrt{2}}{2}] contains only the trivial eigenvalues λ=1\lambda = -1 or λ=0\lambda=0, and any closed interval strictly larger than Ω\Omega will contain eigenvalues of AnA_n for all nn sufficiently large. We also obtain bounds for the maximum and minimum eigenvalues, and for all other eigenvalues we obtain interval bounds that improve as nn increases. Moreover, our approach reveals a more complete picture of the bipartite character of the eigenvalues of AnA_n, namely, as nn increases the eigenvalues are (approximately) symmetric about the number 12-\tfrac{1}{2}. We also obtain an asymptotic distribution of the eigenvalues as nn\rightarrow\infty. Finally, the relationship between the eigenvalues of AnA_n and the eigenvalues of a general threshold graph is discussed.

Keywords

Cite

@article{arxiv.1807.07591,
  title  = {Spectral characterizations of anti-regular graphs},
  author = {Cesar O. Aguilar and Joon-yeob Lee and Eric Piato and Barbara J. Schweitzer},
  journal= {arXiv preprint arXiv:1807.07591},
  year   = {2019}
}

Comments

20 pages, 6 figures, 1 table

R2 v1 2026-06-23T03:07:54.107Z