𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Effective Versions of Local Connectivity Properties

✍ Scribed by Dale Daniel; Timothy H. McNicholl

Book ID
105915233
Publisher
Springer
Year
2011
Tongue
English
Weight
683 KB
Volume
50
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Effective versions of equilogical spaces
Effective versions of equilogical spaces
✍ Dana Scott πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 30 KB

The full category of equilogical spaces can be thought of either as ER(TOP), the category of equivalence relations on T 0 -topological spaces and equivariant continuous maps (i.e., equivalence preserving), or PER(DOM/T), the category of partial equivalence relations on Scott domains with a top (i.e.

Connectivity properties of locally semic
Connectivity properties of locally semicomplete digraphs
✍ Yubao Guo; Lutz Volkmann πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 548 KB

## Abstract It is shown that every __k__‐connected locally semicomplete digraph __D__ with minimum outdegree at least 2__k__ and minimum indegree at least 2__k__ βˆ’ 2 has at least __m__ = max{2, __k__} vertices __x__~1~, __x__~2~, ⃛, __x__~__m__~ such that __D__ βˆ’ __x__~__i__~ is __k__‐connected for

On local connectivity of graphs
On local connectivity of graphs
✍ Lutz Volkmann πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 151 KB

The local connectivity ΞΊ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let Ξ΄(G) be the minimum degree of G. We call a graph G maximally connected when ΞΊ(G) = Ξ΄