A classification of circulant DCI(CI)-digraphs of 2-power order

Authors:
Qiongxiang Huang
Affiliations:
Department of Mathematics, Xinjiang University, Urumuqi, Xinjiang 830046, China
Venue:
Discrete Mathematics
Year:
2003

Citing 12
Cited 1

Isomorphism problem for relational structures with a cyclic automorphism

European Journal of Combinatorics
A´da´m's conjecture is true in the square-free case

Journal of Combinatorial Theory Series A
The automorphism groups of minimal infinite circulant digraphs

European Journal of Combinatorics
On Ádám's conjecture for circulant graphs

Discrete Mathematics
The cyclic groups with the m-DCI property

European Journal of Combinatorics
On isomorphisms of connected Cayley graphs

Discrete Mathematics
Automorphism groups and isomorphisms of Cayley digraphs

Discrete Mathematics - Special issue on Graph theory
On finite groups with the Cayley isomorphism property

Journal of Graph Theory
Isomorphisms of finite Cayley digaphs of bounded valency

Journal of Combinatorial Theory Series B
On isomorphisms of connected Cayley graphs, II

Journal of Combinatorial Theory Series B
On finite groups with the Cayley Isomorphism property, II

Journal of Combinatorial Theory Series A
A classification of DCI (CI)-subsets for cyclic group of odd prime power order

Journal of Combinatorial Theory Series B

Enumeration of 2-regular circulant graphs and directed double networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Let Zn be a cyclic group of order n with unit 0 and C(Zn,S) the circulant digraph of Zn with respect to S ⊆ Zn \ {0}. C(Zn,S) is called a circulant DCI-digraph if, for any circulant digraph C(Zn,T), C(Zn,S) ≅ C(Zn,T) implies that S and T are conjugate in Aut(Zn), the automorphism group of Zn. In this paper, we give a complete classification for circulant DCI-digraphs of 2-power order.