共 50 条
8-SHREDDERS IN 8-CONNECTED GRAPHS
被引:0
|作者:
Takatou, Masanori
[1
]
机构:
[1] Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, Tokyo 1628601, Japan
关键词:
Graph;
connectivity;
shredder;
upper bound;
D O I:
暂无
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
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 G is an 8-connected graph of order at least 177, then the number of shredders of cardinality 8 of G is less than or equal to (2|V (G)|-10)/3.
引用
收藏
页码:147 / 164
页数:18
相关论文