Tenacity and Rupture Degree of Permutation Graphs of Complete Bipartite Graphs

被引：0
|
作者：
Li, Fengwei [1 ]
Ye, Qingfang [1 ]
Li, Xueliang [2 ]
机构：
[1] Shaoxing Univ, Dept Math, Shaoxing 312000, Zhejiang, Peoples R China
[2] Nankai Univ, Ctr Combinator & LPMC, Tianjin 300071, Peoples R China
来源：
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY | 2011年 / 34卷 / 03期
关键词：
Rupture degree; tenacity; permutation graph;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured by various parameters such as connectivity, toughness, tenacity and rupture degree. Among these parameters, tenacity and rupture degree are comparatively better parameters to measure the vulnerability of networks. In this paper, the authors give the exact values for the tenacity and rupture degree of permutation graphs of complete bipartite graphs. (C) 2010 Mathematics Subject Classification: 05C40, 05C90, 68R10, 94C15
引用
收藏
页码：423 / 434
页数：12
相关论文
共 50 条
  • [1] ON THE VULNERABILITY OF PERMUTATION GRAPHS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS
    GUICHARD, D
    PIAZZA, B
    STUECKLE, S
    [J]. ARS COMBINATORIA, 1991, 31 : 149 - 157
  • [2] BIPARTITE PERMUTATION GRAPHS
    SPINRAD, J
    BRANDSTADT, A
    STEWART, L
    [J]. DISCRETE APPLIED MATHEMATICS, 1987, 18 (03) : 279 - 292
  • [3] On opposition graphs, coalition graphs, and bipartite permutation graphs
    Le, Van Bang
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 168 : 26 - 33
  • [4] Bandwidth of Bipartite Permutation Graphs
    Uehara, Ryuhei
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 824 - 835
  • [5] Bipartite Permutation Graphs Are Reconstructible
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 362 - +
  • [6] BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (03)
  • [7] Packing bipartite graphs with covers of complete bipartite graphs
    Chalopin, Jeremie
    Paulusma, Daniel
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 168 : 40 - 50
  • [8] GraPacking Bipartite Graphs with Covers of Complete Bipartite Graphs
    Chalopin, Jeremie
    Paulusma, Daniel
    [J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010, 6078 : 276 - +
  • [9] On the decomposition of graphs into complete bipartite graphs
    Dong, Jinquan
    Liu, Yanpei
    [J]. GRAPHS AND COMBINATORICS, 2007, 23 (03) : 255 - 262
  • [10] On the Decomposition of Graphs into Complete Bipartite Graphs
    Jinquan Dong
    Yanpei Liu
    [J]. Graphs and Combinatorics, 2007, 23 : 255 - 262
12345