Testing set proportionality and the Ádám isomorphism of circulant graphs
DOI10.1016/J.JDA.2005.06.003zbMATH Open1132.68502OpenAlexW2092954984MaRDI QIDQ2458932FDOQ2458932
Authors: Don Coppersmith, Phong Q. Nguyen, Igor E. Shparlinski, N. A. Howgrave-Graham 
Publication date: 5 November 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.06.003
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Circulants and their connectivities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Corrigendum to: On Ádám's conjecture for circulant graphs
- Isomorphism problem for relational structures with a cyclic automorphism
- Ádám's conjecture is true in the square-free case
- A solution of the isomorphism problem for circulant graphs
- Graphs with circulant adjacency matrices
- Isomorphisms of Cayley multigraphs of degree 4 on finite Abelian groups
- Factoring into coprimes in essentially linear time
- Optimal distributed algorithms in unlabeled tori and chordal rings
- On the spectral Ádám property for circulant graphs
- Factor Refinement
- Title not available (Why is that?)
- A note on the Ádám conjecture for double loops.
- The cyclic groups with the \(m\)-DCI property
- Title not available (Why is that?)
This page was built for publication: Testing set proportionality and the Ádám isomorphism of circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458932)
