Isomorphic and Nonisomorphic, Isospectral Circulant Graphs

Simple item page
dc.creatorBrown, Julia
dc.date2009-04-13
dc.date.accessioned2026-07-07T13:03:25Z
dc.date.available2026-07-07T13:03:25Z
dc.descriptionNew 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.
dc.description27 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0904.1968
dc.identifierhttp://arxiv.org/abs/0904.1968
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226793
dc.subjectCombinatorics
dc.subject05C50; 05C60
dc.titleIsomorphic and Nonisomorphic, Isospectral Circulant Graphs
dc.typetext

Files

Collections

arXiv