CONNECTIVITY PROPERTIES OF LOCALLY SEMICOMPLETE DIGRAPHS

Authors
Citation
Yb. Guo et L. Volkmann, CONNECTIVITY PROPERTIES OF LOCALLY SEMICOMPLETE DIGRAPHS, Journal of graph theory, 18(3), 1994, pp. 269-280
Citations number
6
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
03649024
Volume
18
Issue
3
Year of publication
1994
Pages
269 - 280
Database
ISI
SICI code
0364-9024(1994)18:3<269:CPOLSD>2.0.ZU;2-1
Abstract
It is shown that every k-connected locally semicomplete digraph D with minimum outdegree at least 2k and minimum indegree at least 2k - 2 ha s at least m = max{2, k} vertices x1, x2, . . ., x(m) such that D - x( i) is k-connected for i = 1, 2, ..., m. (C) 1994 John Wiley & Sons, In c.