Sherpa Romeo green journal: open accessLet S be a subset of the units in Zn. Let Γ be a circulant graph of order n (a Cayley graph of Zn) such that if ij ∈ E(Γ), then i − j (mod n) ∈ S. Toida conjectured that if Γ0 is another circulant graph of order n, then Γ and Γ 0 are isomorphic if and only if they are isomorphic by a group automorphism of Zn. In this paper, we prove that Toida’s conjecture is true. We further prove that Toida’s conjecture implies Zibin’s conjecture, a generalization of Toida’s conjecture.Ye
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
AbstractLet m be a positive integer such that gcd(m,ϕ(m))=1 (ϕ is Euler's phi function) with m=p1⋯pr...
The problem we discuss here is the conjecture of Ádám [1] concerning the isomorphism problem of cycl...
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...
AbstractWe prove that if two Cayley graphs of Zp3 are isomorphic, then they are isomorphic by a grou...
AbstractWe provide elementary proofs that the groups Zp2andZp3 are CI-groups for Cayley color digrap...
Open accessIn this paper, we begin by partitioning the edge (or arc) set of a circulant (di)graph ac...
We study the Erdős- Sòs conjecture that states that ever graph of average degree greater than k-1 co...
Abstract. It has been shown that Zip is a CI-group for 1 ≤ i ≤ 4, and is not a CI-group for i ≥ 2p−1...
AbstractWe prove a conjecture of Spiga by showing that the number of nonisomorphic Cayley digraphs o...
AbstractIt is shown that Ádám's conjecture is true for the following graphs: (1) nondirected cubic C...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
AbstractIn this paper, we prove several results on the Cayley isomorphism problem concerning undirec...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
AbstractLet m be a positive integer such that gcd(m,ϕ(m))=1 (ϕ is Euler's phi function) with m=p1⋯pr...
The problem we discuss here is the conjecture of Ádám [1] concerning the isomorphism problem of cycl...
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...
AbstractWe prove that if two Cayley graphs of Zp3 are isomorphic, then they are isomorphic by a grou...
AbstractWe provide elementary proofs that the groups Zp2andZp3 are CI-groups for Cayley color digrap...
Open accessIn this paper, we begin by partitioning the edge (or arc) set of a circulant (di)graph ac...
We study the Erdős- Sòs conjecture that states that ever graph of average degree greater than k-1 co...
Abstract. It has been shown that Zip is a CI-group for 1 ≤ i ≤ 4, and is not a CI-group for i ≥ 2p−1...
AbstractWe prove a conjecture of Spiga by showing that the number of nonisomorphic Cayley digraphs o...
AbstractIt is shown that Ádám's conjecture is true for the following graphs: (1) nondirected cubic C...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractÁdám's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulan...
AbstractIn this paper, we prove several results on the Cayley isomorphism problem concerning undirec...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
AbstractLet m be a positive integer such that gcd(m,ϕ(m))=1 (ϕ is Euler's phi function) with m=p1⋯pr...
The problem we discuss here is the conjecture of Ádám [1] concerning the isomorphism problem of cycl...