| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649963 | Discrete Mathematics | 2008 | 8 Pages |
Abstract
A connected graph is λp,qλp,q-connected if there is a set of edges whose deletion leaves two components of order at least pp and qq, respectively. In this paper we present some sufficient conditions for graphs to be λp,qλp,q-connected. Furthermore, we study λ2,qλ2,q-connected graphs in more detail.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dieter Rautenbach, Lutz Volkmann,