Isomorphic and Nonisomorphic, Isospectral Circulant Graphs
Combinatorics
2009-04-14 v1
Abstract
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley graphs of cyclic groups with the same list of eigenvalues of their adjacency matrices will be presented.
Cite
@article{arxiv.0904.1968,
title = {Isomorphic and Nonisomorphic, Isospectral Circulant Graphs},
author = {Julia Brown},
journal= {arXiv preprint arXiv:0904.1968},
year = {2009}
}
Comments
27 pages, 1 figure