On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs
Let D be a strong digraph. An arc subset S is a k-restricted arc cut of D if D − S has a strong component D′ with order at least k such that D\V (D′) contains a connected subdigraph with order at least k. If such a k-restricted arc cut exists in D, then D is called λk-connected. For a λk-connected d...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2022-05-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2259 |