Isomorphic and Nonisomorphic, Isospectral Circulant Graphs

Publication date 13 April 2009

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

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.

This page was built for publication: Isomorphic and Nonisomorphic, Isospectral Circulant Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6213532)