Isomorphic and Nonisomorphic, Isospectral Circulant Graphs

2009/04/13 by Julia Brown, Brown, Julia
Mathematics · #05C50 #05C60 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C50 #msc:05C60

paper · pdf · doi:10.48550/arxiv.0904.1968

27 pages, 1 figure

arxiv created 2009/04/13 · arxiv updated 2009/12/01

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.

Related

• Graphs with three and four distinct eigenvalues based on circulants
• Two families of graphs that are Cayley on nonisomorphic groups
• Spectral properties of the Cayley Graphs of split metacyclic groups
• Isospectral Cayley graphs of some finite simple groups
• Cayley graphs on non-isomorphic groups