𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph

✍ Scribed by Litao Guo; Ruifang Liu; Xiaofeng Guo

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
115 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 47 KB πŸ‘ 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Υ… i Υ… 2d Οͺ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Sufficient conditions for graphs to be Ξ»
Sufficient conditions for graphs to be Ξ»β€²-optimal, super-edge-connected, and maximally edge-connected
✍ Angelika Hellwig; Lutz Volkmann πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

## Abstract The restricted‐edge‐connectivity of a graph __G__, denoted by Ξ»β€²(__G__), is defined as the minimum cardinality over all edge‐cuts __S__ of __G__, where __G__‐__S__ contains no isolated vertices. The graph __G__ is called λ′‐optimal, if Ξ»β€²(__G__) = ξ(__G__), where ΞΎ(__G__) is the minimum