✦ LIBER ✦

Isomorphisms of Finite Cayley Digraphs of Bounded Valency, II

✍ Scribed by Cai Heng Li

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 152 KB
Volume: 87
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1999.2966

No coin nor oath required. For personal study only.

✦ Synopsis

For a finite group G and a subset S of G which does not contain the identity of G, denote by Cay(G, S) the Cayley digraph of G with respect to S. An automorphism _ of the group G induces a graph isomorphism from Cay(G, S) to Cay(G, S _ ). In this paper, we investigate groups G and Cayley digraphs Cay(G, S) of G for which the following condition holds: for any T/G, Cay(G, S)$Cay(G, T) if and only if S _ =T for some _ # Aut(G). For a positive integer m, a group G is called an m-DCI-group if the condition holds for all Cayley digraphs of valency at most m; while G is called a connected m-DCI-group if it holds for all connected digraphs of valency at most m. This paper contributes towards a complete classification of finite m-DCI-groups for m 2. It was previously proved by C. H. Li et al. (1998, J. Combin. Theory Ser. B 74, 164 183) that finite m-DCIgroups for m 2 belong to an explicitly determined list DCI(m) of groups. However, it is still an open problem to determine which members of DCI(m) are really m-DCI-groups. We reduce this problem to the problem of determining whether all subgroups of groups in DCI(m) are connected m-DCI-groups. Then we give a complete classification of finite 2-DCI-groups.

📜 SIMILAR VOLUMES

Isomorphisms of Finite Cayley Digraphs o

Isomorphisms of Finite Cayley Digraphs of Bounded Valency

✍ Cai Heng Li; Cheryl E. Praeger; Ming Yao Xu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Let G be a finite group, S a subset of G" [1], and let Cay(G, S ) denote the Cayley digraph of G with respect to S. If, for all subsets S, T of G"[1] of size at most m, Cay(G, S )$Cay(G, T) implies that S \_ =T for some \_ # Aut(G), then G is called an m-DCI-group. In this paper, we prove that, for

On the Isomorphism Problem for Finite Ca

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

✍ C.H. Li; C.E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each σ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S σ ). For a positive integer m, th

On Isomorphisms of Finite Cayley Graphs

✍ M. Conder; C. Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism σ of G such that S σ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a

Isomorphic factorization of the complete

Isomorphic factorization of the complete graph into Cayley digraphs

✍ G. L. Chia; Poh-Hwa Ong 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on

On Isomorphisms of Connected Cayley Grap

On Isomorphisms of Connected Cayley Graphs, II

✍ Cai Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A Cayley graph or digraph Cay(G, S) of a finite group G is called a CI-graph of G if, for any T/G, Cay(G, S)$Cay(G, T) if and only if S \_ =T for some \_ # Aut(G). We study the problem of determining which Cayley graphs and digraphs for a given group are CI-graphs. A finite group G is called a conne

Circuits in cayley digraphs of finite ab

Circuits in cayley digraphs of finite abelian groups

✍ Anne Marie Wilkinson 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

## Abstract We find all possible lengths of circuits in Cayley digraphs of two‐generated abelian groups over the two‐element generating sets and over certain three‐element generating sets.