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

DOI10.1016/S0020-0190(98)00051-9zbMATH Open1078.68676WikidataQ123199603 ScholiaQ123199603MaRDI QIDQ2583552FDOQ2583552

Bruce Litow, Bernard Mans

Publication date: 17 January 2006

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

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

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)

Cites Work

• Circulants and their connectivities
• Title not available (Why is that?)
• Isomorphism of circulant graphs and digraphs
• Ádám's conjecture is true in the square-free case
• Graphs with circulant adjacency matrices
• Hamiltonian decomposition of Cayley graphs of degree 4
• Optimal distributed algorithms in unlabeled tori and chordal rings

Cited In (4)

• Testing set proportionality and the Ádám isomorphism of circulant graphs
• Constructions of isospectral circulant graphs
• Eigenvalues of Cayley graphs
• The algebraic degree of spectra of circulant 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)