Strong subgraph k-connectivity bounds

2018/03/01 by Sun, Yuefang, Gutin, Gregory · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.1803.00281

Abstract

Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2≤ k≤ n. Strong subgraphs D₁, … , D_p containing S are said to be internally disjoint if V(D_i)∩ V(D_j)=S and A(D_i)∩ A(D_j)=∅ for all 1≤ i

Cited by

• Strong subgraph k-arc-connectivity

Related

• Strong Subgraph Connectivity of Digraphs: A Survey
• Strong Subgraph k-connectivity
• Graphs with large generalized 3-connectivity
• Strong subgraph k-arc-connectivity
• Bipartitions with prescribed order of highly connected digraphs