𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for maximally restricted edge connected graphs

✍ Scribed by Yingying Qin; Jianping Ou

Book ID
113567696
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
189 KB
Volume
312
Category
Article
ISSN
0012-365X

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 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

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

Degree sequence conditions for maximally
Degree sequence conditions for maximally edge-connected graphs and digraphs
✍ Dankelmann, Peter; Volkmann, Lutz πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 88 KB πŸ‘ 2 views

In this paper we give simple degree sequence conditions for the equality of edge-connectivity and minimum degree of a (di-)graph. One of the conditions implies results by BollobΓ‘s, Goldsmith and White, and Xu. Moreover, we give analogue conditions for bipartite (di-)graphs.