Title of article
Some remarks on image-connectedness Original Research Article
Author/Authors
Dieter Rautenbach، نويسنده , , Lutz Volkmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
5562
To page
5569
Abstract
A connected graph is image-connected if there is a set of edges whose deletion leaves two components of order at least image and image, respectively. In this paper we present some sufficient conditions for graphs to be image-connected. Furthermore, we study image-connected graphs in more detail.
Keywords
Edge-connectivity , Restricted edge-connectivity
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947176
Link To Document