  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.
