𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity of addition Cayley graphs

✍ Scribed by David Grynkiewicz; Vsevolod F. Lev; Oriol Serra

Book ID
108167458
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
264 KB
Volume
99
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

-optimally connected mixed Cayley graphs
-optimally connected mixed Cayley graphs
✍ Yingzhi Tian; Jixiang Meng πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 252 KB

A restricted edge cut of a graph X is an edge set whose removal disconnects X into nontrivial components. The cardinality of the minimum restricted edge cut is the restricted edge connectivity, denoted by Ξ» β€² (X). If X has restricted edge cuts and Ξ» β€² (X) achieves the upper bound of the restricted e

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