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

DOI10.1016/S0020-0190(98)00051-9zbMath1078.68676WikidataQ123199603 ScholiaQ123199603MaRDI QIDQ2583552

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) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

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

Cites Work

• Unnamed Item
• 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
• Circulants and their connectivities
• Graphs with circulant adjacency matrices

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