Spectral characterizations of anti-regular graphs

Abstract

We study the eigenvalues of the unique connected anti-regular graph An. 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 =[-1-22, -1+22] contains only the trivial eigenvalues λ = -1 or λ=0, and any closed interval strictly larger than will contain eigenvalues of An for all n sufficiently large. We also obtain bounds for the maximum and minimum eigenvalues, and for all other eigenvalues we obtain interval bounds that improve as n increases. Moreover, our approach reveals a more complete picture of the bipartite character of the eigenvalues of An, namely, as n increases the eigenvalues are (approximately) symmetric about the number -12. We also obtain an asymptotic distribution of the eigenvalues as n→∞. Finally, the relationship between the eigenvalues of An and the eigenvalues of a general threshold graph is discussed.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…