8-SHREDDERS IN 8-CONNECTED GRAPHS

被引：0
|
作者：
Takatou, Masanori [1 ]
机构：
[1] Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, Tokyo 1628601, Japan
来源：
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2008年 / 5卷 / 02期
关键词：
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
相关论文
共 50 条
  • [41] Short Disjoint Paths in Locally Connected Graphs
    Chuanping Chen
    Roman Čada
    Tomáš Kaiser
    Zdeněk Ryjáček
    Graphs and Combinatorics, 2007, 23 : 509 - 519
  • [42] Vertex suppression in 3-connected graphs
    Kriesell, Matthias
    JOURNAL OF GRAPH THEORY, 2008, 57 (01) : 41 - 54
  • [43] Connectivity of connected bipartite graphs with two orbits
    Liang, Xiaodong
    Meng, Jixiang
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 334 - +
  • [44] 2-connected graphs with small 2-connected dominating sets
    Caro, Y
    Yuster, R
    DISCRETE MATHEMATICS, 2003, 269 (1-3) : 265 - 271
  • [45] Lower Bounds for Locally Highly Connected Graphs
    Anna Adamaszek
    Michal Adamaszek
    Matthias Mnich
    Jens M. Schmidt
    Graphs and Combinatorics, 2016, 32 : 1641 - 1650
  • [46] Short disjoint paths in locally connected graphs
    Chen, Chuanping
    Cada, Roman
    Kaiser, Tomas
    Ryjacek, Zdenek
    GRAPHS AND COMBINATORICS, 2007, 23 (05) : 509 - 519
  • [47] Maximal and maximum induced matchings in connected graphs
    Yuan, Bo-Jun
    Yang, Zhao-Yu
    Zheng, Lu
    Gong, Shi-Cai
    APPLIED MATHEMATICS AND COMPUTATION, 2025, 500
  • [48] Large cycles in 4-connected graphs
    Nikoghosyan, M. Zh.
    Nikoghosyan, Zh. G.
    DISCRETE MATHEMATICS, 2011, 311 (04) : 302 - 306
  • [49] Globally bi-3*-connected graphs
    Kao, Shin-Shin
    Hsu, Hong-Chun
    Hsu, Lih-Hsing
    DISCRETE MATHEMATICS, 2009, 309 (08) : 1931 - 1946
  • [50] Minimum 3-geodetically connected graphs
    Bosíková, M
    DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) : 263 - 283
12345