𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monotonicity of strong searching on digraphs

✍ Scribed by Boting Yang; Yi Cao

Publisher
Springer US
Year
2007
Tongue
English
Weight
358 KB
Volume
14
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On strong digraphs with a unique minimal
On strong digraphs with a unique minimally strong subdigraph
✍ Richard A. Brualdi; Rachel Manber πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 659 KB

In this paper we determine the maximum number of &ges that a strong digraph can have if it has a unique minimally stroug subdigraph. We show that this number equais lrils = I)/2 + 1. Furthermore we show that there is, &to an isomorphism, a unique strong &graph which attains this maximum.

On k-strong and k-cyclic digraphs
On k-strong and k-cyclic digraphs
✍ JΓΈrgen Bang-Jensen; Gregory Gutin; Anders Yeo πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 627 KB

Thomassen (1991) proved that there is no degree of strong connectivity which guarantees a cycle through two given vertices in a digraph. In this paper we consider a large family of digraphs, including symmetric digraphs (i.e. digraphs obtained from undirected graphs by replacing each edge by a di