Fault tolerance in digraphs of small diameter

被引：0
|
作者：
Ferrero, D [1 ]
机构：
[1] SW Texas State Univ, Dept Math, San Marcos, TX 78666 USA
来源：
6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL X, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS II | 2002年
关键词：
containers; wide-diameter; fault-diameter;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The length and wide of containers between any pair of vertices of a digraph give a good measure of the fault tolerance of an interconnection network. Indeed, many parameters related to the fault tolerance can be calculated from them, as the connectivity, wide-diameter and fault-diameter. In this paper we give containers and find the values of the connectivities, wide-diameters and fault-diameters for a given class of digraphs of small diameter.
引用
收藏
页码：7 / 10
页数：4
相关论文
共 50 条
  • [1] Arc fault tolerance of Kautz digraphs
    Lin, Shangwei
    Zhou, Chanchan
    Li, Chunfang
    [J]. THEORETICAL COMPUTER SCIENCE, 2017, 687 : 1 - 10
  • [2] VERTEX-SYMMETRICAL DIGRAPHS WITH SMALL-DIAMETER
    COMELLAS, F
    FIOL, MA
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 58 (01) : 1 - 11
  • [3] Fault diameter and fault tolerance of HCN(n,n)
    Lee, HO
    Hur, JH
    Chung, HC
    Cho, CH
    [J]. PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, : 346 - 351
  • [4] Arc fault tolerance of cartesian product digraphs on hyper arc connectivity
    Zhang, Guozhen
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2014, 91 (10) : 2152 - 2162
  • [5] The Diameter of Cyclic Kautz Digraphs
    Bohmova, Katerina
    Dalfo, Cristina
    Huemer, Clemens
    [J]. FILOMAT, 2017, 31 (20) : 6551 - 6560
  • [6] MAXIMUM DIAMETER OF REGULAR DIGRAPHS
    SOARES, J
    [J]. JOURNAL OF GRAPH THEORY, 1992, 16 (05) : 437 - 450
  • [7] On the diameter vulnerability of Kautz digraphs
    Du, DZ
    Hsu, DF
    Lyuu, YD
    [J]. DISCRETE MATHEMATICS, 1996, 151 (1-3) : 81 - 85
  • [8] Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs
    Zhao, Shuang
    Meng, Jixiang
    [J]. COMPUTER JOURNAL, 2019, 62 (05): : 706 - 714
  • [9] Wide and fault diameter in Kneser graphs for enhanced fault tolerance in parallel computing
    Sundara Rajan, R.
    Kirithiga Nandini, G.
    Lin, Yuqing
    Reji, Remi Mariam
    [J]. International Journal of Networking and Virtual Organisations, 2024, 31 (03) : 169 - 190
  • [10] The Diameter of Almost Eulerian Digraphs
    Dankelmann, Peter
    Volkmann, L.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
12345