A classification of circulant DCI(CI)-digraphs of 2-power order
Let \(Z_n\) be a cyclic group of order \(n\) with unit 0 and let the Cayley graph \(C(Z_n,S)\) be the circulant digraph of \(Z_n\) with respect to \(S\subseteq Z_n\backslash \{0\}\). \(C(Z_n,S)\) is called a circulant DCI-digraph if, for any circulant digraph \(C(Z_n,T), C(Z_n,S)\cong C(Z_n,T)\) implies that \(S\) and \(T\) are conjugate in \(\Aut(Z_n)\), the automorphism group of \(Z_n\), and \(S\) is called a DCI-graph of \(\mathbb{Z}_n\) in this case. A finite group \(G\) is called a DCI-group if any subset \(S\) of \(G \backslash \{1\}\) is a DCI-subset. Otherwise \(G\) is an NDCI-group. The author gives a classification of circulant DCI-digraphs of 2-power order, or in other words, of DCI-subsets of \(\mathbb{Z}_2\).
- Enumeration of 2-regular circulant graphs and directed double networks
- A classification of DCI(CI)-subsets for cyclic group of odd prime power order
- A classification of 2-arc-transitive circulant digraphs
- Subgroup sum graphs of finite abelian groups
- Enumeration of cubic Cayley graphs on dihedral groups
- CI-property of \(C_p^2 \times C_n\) and \(C_p^2 \times C_q^2\) for digraphs
- Enumerating Cayley (di-)graphs on dihedral groups
- Enumeration of dicirculant digraphs
This page was built for publication: A classification of circulant DCI(CI)-digraphs of 2-power order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874355)