Restricted connectivity of total digraph


For a strongly connected digraph D = (V (D), A(D)), an arc-cut S ⊆ A(D) is a krestricted arc-cut of D if D − S has at least two strong components of order at least k. The k-restricted arc-connectivity λk(D) is the minimum cardinality of all k-restricted arc-cuts. The k-restricted vertex-connectivity κk(D) can be defined similarly. In this paper, we provide… (More)
DOI: 10.1142/S1793830916500221

2 Figures and Tables


  • Presentations referencing similar topics