Isomorphisms of circulant digraphs
From MaRDI portal
Publication:1804220
DOI10.1007/BF02665228zbMath0823.05042OpenAlexW165498822MaRDI QIDQ1804220
Qiong Xiang Huang, Ji Xiang Meng
Publication date: 28 May 1995
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02665228
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
Subgroup sum graphs of finite abelian groups ⋮ On the isomorphisms and automorphism groups of circulants ⋮ Automorphism groups and isomorphisms of Cayley digraphs ⋮ Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian ⋮ A family of nonnormal Cayley digraphs ⋮ Normal minimal Cayley digraphs of abelian groups ⋮ On the isomorphism problem of Cayley graphs of Abelian groups ⋮ On the isomorphisms of Cayley graphs of Abelian groups.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Adam's conjecture
- Isomorphism of circulant graphs and digraphs
- Minimal diameter double-loop networks: Dense optimal families
- Circulants and their connectivities
- A combinatorial problem related to distributed loop networks
- Reliable circulant networks with minimum transmission delay
- Connectivity of circulant digraphs
- Point-symmetric graphs with a prime number of points
- Isomorphism problem for a special class of graphs
- Graphs with circulant adjacency matrices
This page was built for publication: Isomorphisms of circulant digraphs