Characterization of c -circulant digraphs of degree two which are circulant
1997
Abstract A c -circulant digraph G N ( c , Δ ) has Z N as its vertex set and adjacency rules given by x → cx + a with α ϵ Δ ⋐ Z N . The c -circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding isomorphism is given. Moreover, a sufficient condition is obtained for a c -circulant digraph to be a Cayley digraph.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
8
References
5
Citations
NaN
KQI