✦ LIBER ✦

-optimally connected mixed Cayley graphs

✍ Scribed by Yingzhi Tian; Jixiang Meng

Book ID: 104001082
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 252 KB
Volume: 24
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.12.037

No coin nor oath required. For personal study only.

✦ Synopsis

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 edge connectivity, X is said to be λ ′ -optimal. In this work, we will prove that for all but a few exceptions, the mixed Cayley graph is λ ′ -optimal.

📜 SIMILAR VOLUMES

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-

Connectivity of minimal Cayley graphs

✍ C. D. Godsil 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 175 KB

Connectivity of addition Cayley graphs

✍ David Grynkiewicz; Vsevolod F. Lev; Oriol Serra 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 264 KB

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

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 the connectivity of cayley graphs

✍ Wilfried Imrich 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 282 KB