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
相关论文
共 50 条
  • [22] A note on pancyclism of highly connected graphs
    Flandrin, E
    Li, H
    Marczyk, A
    Wozniak, M
    DISCRETE MATHEMATICS, 2004, 286 (1-2) : 57 - 60
  • [23] On group hypo-connected graphs
    Sun, Qiang
    Shan, Erfang
    UTILITAS MATHEMATICA, 2016, 99 : 319 - 330
  • [24] Hamilton-connected indices of graphs
    Chen, Zhi-Hong
    Lai, Hong-Jian
    Xiong, Liming
    Yan, Huiya
    Zhan, Mingquan
    DISCRETE MATHEMATICS, 2009, 309 (14) : 4819 - 4827
  • [25] Dynamics of epidemic spreading on connected graphs
    Christophe Besse
    Grégory Faye
    Journal of Mathematical Biology, 2021, 82
  • [26] Ordering connected graphs by their Kirchhoff indices
    Xu, Kexiang
    Das, Kinkar Ch.
    Zhang, Xiao-Dong
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2016, 93 (10) : 1741 - 1755
  • [27] Dynamics of epidemic spreading on connected graphs
    Besse, Christophe
    Faye, Gregory
    JOURNAL OF MATHEMATICAL BIOLOGY, 2021, 82 (06)
  • [28] 2-connected and 2-edge-connected Steinhaus graphs
    Kim, D
    Lim, D
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 257 - 265
  • [29] Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
    Dong, Fengming
    Yan, Weigen
    JOURNAL OF GRAPH THEORY, 2017, 85 (01) : 74 - 93
  • [30] The effect on eigenvalues of connected graphs by adding edges
    Guo, Ji-Ming
    Tong, Pan-Pan
    Li, Jianxi
    Shiu, Wai Chee
    Wang, Zhi-Wen
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2018, 548 : 57 - 65