On the spectral Ádám property for circulant graphs
From MaRDI portal
Publication:1613548
DOI10.1016/S0012-365X(01)00374-0zbMath1035.05059OpenAlexW2134596794MaRDI QIDQ1613548
Bernard Mans, Igor E. Shparlinski, Francesco Pappalardi
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00374-0
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (11)
Constructions of isospectral circulant graphs ⋮ Eigenvalues of Cayley graphs ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Searching for (near) Optimal Codes ⋮ Random walks, bisections and gossiping in circulant graphs ⋮ Testing set proportionality and the Ádám isomorphism of circulant graphs ⋮ On the average energy of circulant graphs ⋮ The algebraic degree of spectra of circulant graphs ⋮ Splitting fields of spectra of circulant graphs ⋮ Unnamed Item ⋮ Minimum chromaticity of circulant graphs
This page was built for publication: On the spectral Ádám property for circulant graphs
