Suppose that Π=Cay(Zn,Ω) and Λ=Cay(Zn,Ψm) are two Cayley graphs on the cyclic additive group Zn, where n is an even integer, m=n/2+1, Ω=t∈Zn∣t is odd, and Ψm=Ω∪{n/2} are the inverse-closed subsets of Zn-0. In this paper, it is shown that Π is a distance-transitive graph, and, by this fact, we determine the adjacency matrix spectrum of Π. Finally, we show that if n≥8 and n/2 is an even integer, then the adjacency matrix spectrum of Λ is n/2+11, 1-n/21, 1n-4/2, -1n/2 (we write multiplicities as exponents)
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
This thesis concerns the analysis and construction of extremal circulant and other Abelian Cayley gr...
AbstractLet Γ(G, T) denote the Cayley graph of a finite group G with respect to a normal subset T of...
<p>Let $\Gamma=Cay(\mathbb{Z}_n, S_k)$ be the Cayley graph on the cyclic additive group $\mathbb{Z}_...
AbstractProperties of a graph (directed or undirected) whose adjacency matrix is a circulant are stu...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
AbstractA classification of strongly regular Cayley graphs of cyclic group was independently achieve...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
International audienceA circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$...
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
Abstract. We prove that any circulant graph of order n with connection set S such that n and the ord...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
This thesis concerns the analysis and construction of extremal circulant and other Abelian Cayley gr...
AbstractLet Γ(G, T) denote the Cayley graph of a finite group G with respect to a normal subset T of...
<p>Let $\Gamma=Cay(\mathbb{Z}_n, S_k)$ be the Cayley graph on the cyclic additive group $\mathbb{Z}_...
AbstractProperties of a graph (directed or undirected) whose adjacency matrix is a circulant are stu...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
AbstractA classification of strongly regular Cayley graphs of cyclic group was independently achieve...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
International audienceA circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$...
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulan...
AbstractThe distance energy of a graph G is a recently developed energy-type invariant, defined as t...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
Abstract. We prove that any circulant graph of order n with connection set S such that n and the ord...
AbstractThis paper deals with the enumeration of various families of Cayley graphs and digraphs. Bot...
This thesis concerns the analysis and construction of extremal circulant and other Abelian Cayley gr...
AbstractLet Γ(G, T) denote the Cayley graph of a finite group G with respect to a normal subset T of...