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 条
  • [1] k-Shredders in k-Connected Graphs
    Egawa, Yoshimi
    JOURNAL OF GRAPH THEORY, 2008, 59 (03) : 239 - 259
  • [2] 10-SHREDDERS IN 10-CONNECTED GRAPHS
    Hirata, Naoki
    Takatou, Masanori
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2013, 10 (04) : 427 - 458
  • [3] 5-Shredders in 5-connected graphs
    Egawa, Yoshimi
    Okadome, Yumiko
    Takatou, Masanori
    DISCRETE MATHEMATICS, 2009, 309 (06) : 1565 - 1574
  • [4] A chronological and mathematical overview of digital circle generation algorithms - introducing efficient 4-and 8-connected circles
    Barrera, T.
    Hast, A.
    Bengtsson, E.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2016, 93 (08) : 1241 - 1253
  • [5] INTERNALLY 4-CONNECTED GRAPHS WITH NO {CUBE, V8}-MINOR
    Lewchalermvongs, Chanun
    Ananchuen, Nawarat
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (02) : 481 - 501
  • [6] Minimal least eigenvalue of connected graphs of order n and size m = n + k (5 ⩽ k ⩽ 8)
    Xin Li
    Jiming Guo
    Zhiwen Wang
    Frontiers of Mathematics in China, 2019, 14 : 1213 - 1230
  • [7] BRIDGES IN HIGHLY CONNECTED GRAPHS
    Wollan, Paul
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) : 1731 - 1741
  • [8] Minimal least eigenvalue of connected graphs of order n and size m = n plus k (5 ≤ k ≤ 8)
    Li, Xin
    Guo, Jiming
    Wang, Zhiwen
    FRONTIERS OF MATHEMATICS IN CHINA, 2019, 14 (06) : 1213 - 1230
  • [9] A CONCEPT OF WEIGHTED CONNECTIVITY ON CONNECTED GRAPHS
    Amer, Rafael
    Gimenez, Jose Miguel
    APLIMAT 2009: 8TH INTERNATIONAL CONFERENCE, PROCEEDINGS, 2009, : 43 - 48
  • [10] ON CONNECTED COLOURINGS OF GRAPHS
    Daneshgar, Amir
    Hajiabolhassan, Hossein
    Hamedazimi, Navid
    ARS COMBINATORIA, 2008, 89 : 115 - 126
12345