On the number of shredders

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

A subset S of k vertices in a k-connected graph G is a shredder, if G - S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [Cheriyan & Thurimella, Proc 28th Ann ACM Symp, 1996]. If G contains no meshing shredders (in particular, if k ≤ 3), the sharp upper bound [(n - k - 1)/2] is proven.

Original languageEnglish
Pages (from-to)195-200
Number of pages6
JournalJournal of Graph Theory
Volume31
Issue number3
Publication statusPublished - Jul 1999

Fingerprint

Meshing
Connected graph
Upper bound
Subset

Keywords

  • Connectivity
  • k-connected graphs
  • Minimum cuts

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

On the number of shredders. / Jordán, T.

In: Journal of Graph Theory, Vol. 31, No. 3, 07.1999, p. 195-200.

Research output: Contribution to journalArticle

Jordán, T 1999, 'On the number of shredders', Journal of Graph Theory, vol. 31, no. 3, pp. 195-200.
Jordán, T. / On the number of shredders. In: Journal of Graph Theory. 1999 ; Vol. 31, No. 3. pp. 195-200.
@article{1fec95bbdec045b1a55918bd1cb7b458,
title = "On the number of shredders",
abstract = "A subset S of k vertices in a k-connected graph G is a shredder, if G - S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [Cheriyan & Thurimella, Proc 28th Ann ACM Symp, 1996]. If G contains no meshing shredders (in particular, if k ≤ 3), the sharp upper bound [(n - k - 1)/2] is proven.",
keywords = "Connectivity, k-connected graphs, Minimum cuts",
author = "T. Jord{\'a}n",
year = "1999",
month = "7",
language = "English",
volume = "31",
pages = "195--200",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - On the number of shredders

AU - Jordán, T.

PY - 1999/7

Y1 - 1999/7

N2 - A subset S of k vertices in a k-connected graph G is a shredder, if G - S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [Cheriyan & Thurimella, Proc 28th Ann ACM Symp, 1996]. If G contains no meshing shredders (in particular, if k ≤ 3), the sharp upper bound [(n - k - 1)/2] is proven.

AB - A subset S of k vertices in a k-connected graph G is a shredder, if G - S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [Cheriyan & Thurimella, Proc 28th Ann ACM Symp, 1996]. If G contains no meshing shredders (in particular, if k ≤ 3), the sharp upper bound [(n - k - 1)/2] is proven.

KW - Connectivity

KW - k-connected graphs

KW - Minimum cuts

UR - http://www.scopus.com/inward/record.url?scp=0033468580&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033468580&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033468580

VL - 31

SP - 195

EP - 200

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -