𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On isomorphisms of connected Cayley graphs

✍ Scribed by Li Cai Heng


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
696 KB
Volume
178
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


Let G be a finite group and Cay(G,S) the Cayley graph of G with respect to S. A subset S is called a CI-subset if, for any TCG, Cay(G,S) ~ Cay(G,T) implies S ~ = T for some ct E Aut(G). In this paper, we investigate the finite groups G in which every subset S with size at most m and (S) = G is a CI-subset where m is a positive integer. As a corollary, we classify symmetric graphs of order p3 and of valency 2p where p is a prime.


πŸ“œ SIMILAR VOLUMES


On Isomorphisms of Connected Cayley Grap
✍ 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

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 Cayley graphs on nonisomorphi
✍ Morris, Joy πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 349 KB

The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.

On the Isomorphisms of Cayley Graphs of
✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 190 KB

Let G be a finite group, S a subset of G=f1g; and let Cay ðG; SÞ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayðG; SÞ ffi CayðG; T Þ implies that S a ¼ T for some a 2 AutðGÞ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene

Hamilton-Connected Cayley Graphs on Hami
✍ Brian Alspach; Yusheng Qin πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 109 KB

It is proven that every connected Cayley graph X , of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite.