𝔖 Bobbio Scriptorium
✦   LIBER   ✦

High connectivity keeping sets in graphs and digraphs

✍ Scribed by W. Mader

Book ID
108113483
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
214 KB
Volume
302
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Distance connectivity in graphs and digr
Distance connectivity in graphs and digraphs
✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i

Super Connectivity of Line Graphs and Di
Super Connectivity of Line Graphs and Digraphs
✍ Min LΓΌ; Jun-Ming Xu πŸ“‚ Article πŸ“… 2006 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 121 KB
Connectivity of large bipartite digraphs
Connectivity of large bipartite digraphs and graphs
✍ M.C. Balbuena; A. Carmona; J. FΓ brega; M.A. Fiol πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 638 KB

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu

The connectivity of large digraphs and g
The connectivity of large digraphs and graphs
✍ M. A. Fiol πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 632 KB

## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree Ξ΄, maximum degree Ξ”, diameter __D__, and a new parameter l~pi;~, __0__ ≀ Ο€ ≀ Ξ΄ βˆ’ 2, related with the number of short paths (in the case of graphs