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 条