arXiv Analytics

Sign in

arXiv:1511.03513 [math.CO]AbstractReferencesReviewsResources

The spectrum of an I-graph

Allana S. S. de Oliveira, Cybele T. M. Vinagre

Published 2015-11-11Version 1

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.

Comments: 16 pages, 1 figure
Categories: math.CO
Subjects: 05C50, 15B05
Related articles: Most relevant | Search more
arXiv:1301.0374 [math.CO] (Published 2013-01-03, updated 2013-01-05)
The triangle-free graphs with rank 6
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh
arXiv:1706.03298 [math.CO] (Published 2017-06-11)
Polynomial Relations Between Matrices of Graphs

Links

Toolbox