𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs

✍ Scribed by Shiying Wang; Jun Yuan; Aixia Liu

Book ID
106047753
Publisher
Springer Japan
Year
2008
Tongue
English
Weight
127 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sufficient conditions for maximally conn
Sufficient conditions for maximally connected dense graphs
✍ Terunao Soneoka; Hiroshi Nakada; Makoto Imase; Claudine Peyrat πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 764 KB

This paper considers the relations between the connectivity x or the edge-connectivity A of a graph and other parameters such as the number of vertices n, maximum degree A, minimum degree 6, diameter D and girth g. The following sufficient conditions for maximally connected graphs are derived. 6fir

Sufficient conditions for a graph to be
Sufficient conditions for a graph to be super restricted edge-connected
✍ Shiying Wang; Shangwei Lin πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 236 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut __F__ of a connected graph __G__ is an edge cut such that __G__‐__F__ has no isolated vertex. The restricted edge connectivity Ξ»β€² is the minimum cardinality over all re

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