Strong Subgraph Connectivity of Digraphs

Sun, YF; Gutin, G

Gutin, G (corresponding author), Royal Holloway Univ London, Dept Comp Sci, Surrey TW20 0EX, England.

GRAPHS AND COMBINATORICS, ; ():

Abstract

Let D = (V, A) be a digraph of order n, S a subset of V of size k and 2 <= k <= n. A strong subgraph H of D is called an S-strong subgraph if S ......

Full Text Link