𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conditional graph connectivity relative to hereditary properties

✍ Scribed by Ortrud R. Oellermann

Book ID
102961609
Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
553 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Neighborhood conditions for graphs to be
Neighborhood conditions for graphs to be super restricted edge connected
✍ Shiying Wang; Jing Li; Lihong Wu; Shangwei Lin πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 212 KB

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

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,