The spectrum of an I-graph
Combinatorics
2015-11-12 v1
Abstract
We completely determine the spectrum of an -graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in -graphs by using an spectral approach. With our result, we also determine the nullity of a certain subfamily of -graphs.
Cite
@article{arxiv.1511.03513,
title = {The spectrum of an I-graph},
author = {Allana S. S. de Oliveira and Cybele T. M. Vinagre},
journal= {arXiv preprint arXiv:1511.03513},
year = {2015}
}
Comments
16 pages, 1 figure