2018/08/08 by Yuefang Sun, Gregory Gutin, Sun, Yuefang +1
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.1808.02740
openalex publication_date 2018/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this survey we overview known results on the strong subgraph k-connectivity and strong subgraph k-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and complexity, sharp bounds for strong subgraph k-(arc-)connectivity, minimally strong subgraph (k, ℓ)-(arc-) connected digraphs. This survey contains several conjectures and open problems for further study.