Restricted Vertex Connectivity of Harary Graphs

被引:0
|
作者
Chen, Yingying [1 ]
Meng, Jixiang [1 ]
Tian, Yingzhi [1 ]
机构
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
关键词
R-g-vertex connectivity; Harary graph; R-g-vertex-atom-part; RELIABLE NETWORKS;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A vertex cut that separates the connected graph into components such that every vertex in these components has at least g neighbors is an R-g-vertex-cut. R-g-vertex-connectivity, denote by kappa(g) (G), is the cardinality of a minimum R-g-vertex-cut of G. In this paper, we will determine kappa(g) and characterize the R-g-vertex-atom-part for the first and second type Harary graphs.
引用
收藏
页码:287 / 297
页数:11
相关论文
共 50 条
  • [31] On restricted edge-connectivity of graphs
    Xu , JM
    Xu, KL
    DISCRETE MATHEMATICS, 2002, 243 (1-3) : 291 - 298
  • [32] Restricted edge connectivity of graphs on degree
    Guo, Litao
    Lin, Bernard L. S.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 35 (04) : 3955 - 3958
  • [33] On a kind of restricted edge connectivity of graphs
    Meng, JX
    Ji, YH
    DISCRETE APPLIED MATHEMATICS, 2002, 117 (1-3) : 183 - 193
  • [34] Efficient algorithm for the vertex connectivity of trapezoid graphs
    Ilic, Aleksandar
    INFORMATION PROCESSING LETTERS, 2013, 113 (10-11) : 398 - 404
  • [35] 2-Vertex Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Laura, Luigi
    Parotsidis, Nikos
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 605 - 616
  • [36] Using expander graphs to find vertex connectivity
    Gabow, HN
    41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 410 - 420
  • [37] Cyclic Vertex Connectivity of Trivalent Cayley Graphs
    Ke, Jenn-Yang
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2018, E101D (07): : 1828 - 1834
  • [38] Connectivity Oracles for Graphs Subject to Vertex Failures
    Duan, Ran
    Pettie, Seth
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 490 - 509
  • [39] Using expander graphs to find vertex connectivity
    Gabow, Harold N.
    JOURNAL OF THE ACM, 2006, 53 (05) : 800 - 844
  • [40] Algebraic Connectivity and Disjoint Vertex Subsets of Graphs
    Sun, Yan
    Li, Faxu
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020