A note on the Ádám conjecture for double loops.

DOI10.1016/S0020-0190(98)00051-9MaRDI QIDQ2583552zbMATH OpenWikidataFDO

Authors Bruce Litow, Bernard Mans

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Interconnection networksCirculant graphsGraph isomorphismÁdám property

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Publication:3197857
• Corrigendum to: On Ádám's conjecture for circulant graphs
• On the spectral Ádám property for circulant graphs
• Publication:4945887
• scientific article; zbMATH DE number 1159313

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• Circulants and their connectivities
• Graphs with circulant adjacency matrices
• Hamiltonian decomposition of Cayley graphs of degree 4
• Isomorphism of circulant graphs and digraphs
• Optimal distributed algorithms in unlabeled tori and chordal rings
• Ádám's conjecture is true in the square-free case

Cited in

(4)

• Constructions of isospectral circulant graphs
• Testing set proportionality and the Ádám isomorphism of circulant graphs
• The algebraic degree of spectra of circulant graphs
• Eigenvalues of Cayley graphs

This page was built for publication: A note on the Ádám conjecture for double loops.

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