𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super-connectivity and super-edge-connectivity for some interconnection networks

✍ Scribed by Y-Chuang Chen; Jimmy J.M. Tan; Lih-Hsing Hsu; Shin-Shin Kao

Book ID
108395667
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
130 KB
Volume
140
Category
Article
ISSN
0096-3003

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

On super-edge-connected digraphs and bip
On super-edge-connected digraphs and bipartite digraphs
✍ M. A. Fiol πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 524 KB

## Abstract A maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diamet