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 条
  • [31] The ordering of trees and connected graphs by algebraic connectivity
    Shao, Jia-Yu
    Gua, Ji-Ming
    Shan, Hai-Ying
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 428 (07) : 1421 - 1438
  • [32] On (2, k)-Hamilton-connected graphs
    Dai, Tianjiao
    Li, Hao
    Ouyang, Qiancheng
    Tian, Zengxian
    DISCRETE APPLIED MATHEMATICS, 2024, 343 : 288 - 299
  • [33] Wiener Index of k-Connected Graphs
    Qin, Xiang
    Zhao, Yanhua
    Wu, Baoyindureng
    JOURNAL OF INTERCONNECTION NETWORKS, 2021, 21 (04)
  • [34] Rainbow Connection in 3-Connected Graphs
    Xueliang Li
    Yongtang Shi
    Graphs and Combinatorics, 2013, 29 : 1471 - 1475
  • [35] On connected k-domination numbers, of graphs
    Li, SG
    DISCRETE MATHEMATICS, 2004, 274 (1-3) : 303 - 310
  • [36] Rooted minor problems in highly connected graphs
    Kawarabayashi, K
    DISCRETE MATHEMATICS, 2004, 287 (1-3) : 121 - 123
  • [37] Maximally edge-connected and vertex-connected graphs and digraphs: A survey
    Hellwig, Angelika
    Volkmann, Lutz
    DISCRETE MATHEMATICS, 2008, 308 (15) : 3265 - 3296
  • [38] Strongly 2-connected orientations of graphs
    Thomassen, Carsten
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 110 : 67 - 78
  • [39] Spanning 3-connected index of graphs
    Xiong, Wei
    Zhang, Zhao
    Lai, Hong-Jian
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 199 - 208
  • [40] Characterization of minimally (2, l)-connected graphs
    Gu, Xiaofeng
    Lai, Hong-Jian
    Yao, Senmei
    INFORMATION PROCESSING LETTERS, 2011, 111 (23-24) : 1124 - 1129
12345