k-Shredders in k-Connected Graphs

被引:3
|
作者
Egawa, Yoshimi [1 ]
机构
[1] Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, Tokyo 1628601, Japan
关键词
graph; connectivity; shredder; upper bound;
D O I
10.1002/jgt.20336
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a graph G, a subset S of V(G) is called a shredder if G - S consists of three or more components. We show that if k >= 4 and G is a k-connected graph, then the number of shredders of cardinality k of G is less than 2 vertical bar V(G)vertical bar/3 (we show a better bound for k = 4). (C) 2008 Wiley Periodicals, Inc. J Graph Theory 59: 239-259, 2008
引用
下载
收藏
页码:239 / 259
页数:21
相关论文
共 50 条
  • [31] ON THE BOUNDS OF LAPLACIAN EIGENVALUES OF k-CONNECTED GRAPHS
    Chen, Xiaodan
    Hou, Yaoping
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2015, 65 (03) : 701 - 712
  • [32] Edge bounds in nonhamiltonian k-connected graphs
    Byer, Owen D.
    Smeltzer, Deirdre L.
    DISCRETE MATHEMATICS, 2007, 307 (13) : 1572 - 1579
  • [33] Hamiltonicity of k-connected graphs with independent claws
    Shen, RQ
    Tian, F
    Wei, B
    ARS COMBINATORIA, 1997, 47 : 307 - 312
  • [34] Intersections of longest cycles in k-connected graphs
    Chen, GT
    Faudree, RJ
    Gould, RJ
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 72 (01) : 143 - 149
  • [35] Contractible edges of k-connected graphs for k=4, 5
    Qin, Chengfu
    Guo, Xiaofeng
    ARS COMBINATORIA, 2010, 97 : 321 - 332
  • [36] Contractible edges in minimally k-connected graphs
    Ando, Kiyoshi
    Kaneko, Atsushi
    Kawarabayashi, Ken-ichi
    DISCRETE MATHEMATICS, 2008, 308 (04) : 597 - 602
  • [37] Forbidden pairs for k-connected Hamiltonian graphs
    Chen, Guantao
    Egawa, Yoshimi
    Gould, Ronald J.
    Saito, Akira
    DISCRETE MATHEMATICS, 2012, 312 (05) : 938 - 942
  • [38] Clique vectors of k-connected chordal graphs
    Goodarzi, Afshin
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2015, 132 : 188 - 193
  • [39] (s, m)-radius of k-connected graphs
    Li, Hao
    Li, Jianping
    DISCRETE MATHEMATICS, 2009, 309 (05) : 1163 - 1177
  • [40] Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
    Cheriyan, Joseph
    Thurimella, Ramakrishna
    Journal of Algorithms, 1999, 33 (01): : 15 - 50