𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity of minimal Cayley graphs

✍ Scribed by C. D. Godsil

Book ID
112501417
Publisher
Springer
Year
1981
Tongue
English
Weight
175 KB
Volume
37
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connectivity of addition Cayley graphs
Connectivity of addition Cayley graphs
✍ David Grynkiewicz; Vsevolod F. Lev; Oriol Serra πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 264 KB
-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-

The connectivity of minimal imperfect gr
The connectivity of minimal imperfect graphs
✍ SebοΏ½, AndrοΏ½s πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 535 KB

We prove that partitionable graphs are 2w -2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2w -2. The proof of the connectivity result is a simple linear algebraic proof.