AbstractC.H. Li recently made the following conjecture: Let Γ be a circulant digraph of order n=n1n2 and degree m, where gcd(n1,n2)=1, n1 divides 4k, where k is odd and square-free, and every prime divisor of n2 is greater than m, or, if Γ is a circulant graph, every prime divisor of n2 is greater than 2m. Then Γ is a CI-digraph of Zn. In this paper we verify that this conjecture is true
AbstractThe circulant digraph Γ is considered when the number n of vertices of Γ is equal to pm for ...
Open access, licensed under Creative CommonsWe attempt to determine the structure of the automorphis...
AbstractLet m be a positive integer such that gcd(m,ϕ(m))=1 (ϕ is Euler's phi function) with m=p1⋯pr...
AbstractC.H. Li recently made the following conjecture: Let Γ be a circulant digraph of order n=n1n2...
We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n...
Sherpa Romeo green journal: open accessLet S be a subset of the units in Zn. Let Γ be a circulant gr...
AbstractWe prove a conjecture of Spiga by showing that the number of nonisomorphic Cayley digraphs o...
AbstractInspired by Ádám's conjecture the isomorphism problem of circulant digraphs is widely invest...
AbstractWe prove that if two Cayley graphs of Zp3 are isomorphic, then they are isomorphic by a grou...
AbstractWe extend the characterization of the c-circulant digraphs of degree two which are circulant...
AbstractIn this paper, we prove several results on the Cayley isomorphism problem concerning undirec...
AbstractWe provide elementary proofs that the groups Zp2andZp3 are CI-groups for Cayley color digrap...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
AbstractLet Zn be a cyclic group of order n with unit 0 and C(Zn,S) the circulant digraph of Zn with...
Open accessIn this paper, we begin by partitioning the edge (or arc) set of a circulant (di)graph ac...
AbstractThe circulant digraph Γ is considered when the number n of vertices of Γ is equal to pm for ...
Open access, licensed under Creative CommonsWe attempt to determine the structure of the automorphis...
AbstractLet m be a positive integer such that gcd(m,ϕ(m))=1 (ϕ is Euler's phi function) with m=p1⋯pr...
AbstractC.H. Li recently made the following conjecture: Let Γ be a circulant digraph of order n=n1n2...
We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n...
Sherpa Romeo green journal: open accessLet S be a subset of the units in Zn. Let Γ be a circulant gr...
AbstractWe prove a conjecture of Spiga by showing that the number of nonisomorphic Cayley digraphs o...
AbstractInspired by Ádám's conjecture the isomorphism problem of circulant digraphs is widely invest...
AbstractWe prove that if two Cayley graphs of Zp3 are isomorphic, then they are isomorphic by a grou...
AbstractWe extend the characterization of the c-circulant digraphs of degree two which are circulant...
AbstractIn this paper, we prove several results on the Cayley isomorphism problem concerning undirec...
AbstractWe provide elementary proofs that the groups Zp2andZp3 are CI-groups for Cayley color digrap...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
AbstractLet Zn be a cyclic group of order n with unit 0 and C(Zn,S) the circulant digraph of Zn with...
Open accessIn this paper, we begin by partitioning the edge (or arc) set of a circulant (di)graph ac...
AbstractThe circulant digraph Γ is considered when the number n of vertices of Γ is equal to pm for ...
Open access, licensed under Creative CommonsWe attempt to determine the structure of the automorphis...
AbstractLet m be a positive integer such that gcd(m,ϕ(m))=1 (ϕ is Euler's phi function) with m=p1⋯pr...