𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Neighborhood conditions for graphs to be super restricted edge connected

✍ Scribed by Shiying Wang; Jing Li; Lihong Wu; Shangwei Lin

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
212 KB
Volume
56
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Restricted edge connectivity is a more refined network reliability index than edge connectivity. For a connected graph G = (V, E), an edge set S ⊆ E is a restricted edge cut if G − S is disconnected and every component of G − S has at least two vertices. The restricted edge connectivity of G is defined as the cardinality of a minimum restricted edge cut. G is super restricted edge connected if every minimum restricted edge cut of G isolates one edge. In this article, we present several neighborhood conditions for a graph to be super restricted edge connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010

📜 SIMILAR VOLUMES

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

A necessary and sufficient condition for
A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
✍ Zhou Huai-Lu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,