Strong Subgraph Connectivity of Digraphs: A Survey
Discrete Mathematics
2018-08-09 v1 Combinatorics
Abstract
In this survey we overview known results on the strong subgraph -connectivity and strong subgraph -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 -(arc-)connectivity, minimally strong subgraph -(arc-) connected digraphs. This survey contains several conjectures and open problems for further study.
Cite
@article{arxiv.1808.02740,
title = {Strong Subgraph Connectivity of Digraphs: A Survey},
author = {Yuefang Sun and Gregory Gutin},
journal= {arXiv preprint arXiv:1808.02740},
year = {2018}
}