On isomorphisms of circulant digraphs of bounded degree

DOI10.1016/j.disc.2007.11.024zbMath1168.05043OpenAlexW1967930470MaRDI QIDQ998343

Edward Dobson

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.024

zbMATH Keywords

Cayley graphisomorphismcirculant graphCayley isomorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian

Cites Work

• The composition of graphs
• Isomorphism of circulant graphs and digraphs
• On the isomorphism problem for cyclic combinatorial objects
• The cyclic groups with the \(m\)-DCI property
• Corrigendum to: On Ádám's conjecture for circulant graphs
• On isomorphisms of finite Cayley graphs---a survey
• Ádám's conjecture is true in the square-free case
• Isomorphism problem for Cayley graphs of \(\mathbb{Z}^ 3_ p\)
• Isomorphism problem for a class of point-symmetric structures
• A solution of the isomorphism problem for circulant graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item