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

A note on connected cubic Cayley graphs

โœ Scribed by Han, Hua; Lu, Zai Ping


Book ID
120369757
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
352 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On Cubic Nonsymmetric Cayley Graphs
โœ Li, Jingjian; Lou, Bengong; Wang, Rui ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Scientific Research Publishing โš– 129 KB
A note on Cayley graphs
โœ Marston Conder ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB
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-

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

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.