𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity

✍ Scribed by Yong Qin; Wenjun Xiao; Štefko Miklavič

Book ID
108114109
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
418 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton-Connected Cayley Graphs on Hami
Hamilton-Connected Cayley Graphs on Hamiltonian Groups
✍ 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.

On isomorphisms of connected Cayley grap
On isomorphisms of connected Cayley graphs
✍ 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
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