arXiv:1901.08048 [math.CO]AbstractReferencesReviewsResources
A general method to obtain the spectrum and local spectra of a graph from its regular partitions
Published 2019-01-23Version 1
It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, we propose a method to obtain all the spectrum, and also the local spectra, of a graph $\Gamma$ from the quotient matrices of some of its regular partitions. As examples, it is shown how to find the eigenvalues and (local) multiplicities of walk-regular, distance-regular, and distance-biregular graphs.
Categories: math.CO
Related articles: Most relevant | Search more
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:1508.05281 [math.CO] (Published 2015-08-21)
Directed strongly walk-regular graphs