Premium
Connectivity properties of locally semicomplete digraphs
Author(s) -
Guo Yubao,
Volkmann Lutz
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180306
Subject(s) - digraph , combinatorics , mathematics
It is shown that every k ‐connected locally semicomplete digraph D with minimum outdegree at least 2 k and minimum indegree at least 2 k − 2 has at least m = max{2, k } vertices x 1 , x 2 , ⃛, x m such that D − x i is k ‐connected for i = 1, 2, ⃛, m .