๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Isomorphisms of Minimal Cayley Graphs and Digraphs

โœ Scribed by Cai Heng Li; Sanming Zhou


Publisher
Springer Japan
Year
2001
Tongue
English
Weight
119 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Isomorphic factorization of the complete
โœ 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 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

On isomorphisms of connected Cayley grap
โœ Li Cai Heng ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

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-

Isomorphisms of Cayley graphs. II
โœ L. Babai; P. Frankl ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Akadmiai Kiad ๐ŸŒ English โš– 439 KB
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