The spectrum of an I-graph

Abstract

We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach. With our result, we also determine the nullity of a certain subfamily of $I$-graphs.

arXiv comment16 pages, 1 figure

Cited by in corpus (1)

• On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials