Node fault tolerance in graphs

被引:1
|
作者
Harary, F [1 ]
Hayes, JP [1 ]
机构
[1] UNIV MICHIGAN,DEPT ELECT ENGN & COMP SCI,ANN ARBOR,MI 48109
关键词
D O I
10.1002/(SICI)1097-0037(199601)27:1<19::AID-NET2>3.0.CO;2-H
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A graph G* is a k-node fault-tolerant supergraph of a graph G, denoted k-NFT(G), if every graph obtained by removing k nodes from G* contains G. A k-NFT(G) graph G* is said to be optimal if it contains n + k nodes, where n is the number of nodes of G and G* has the minimum number of edges among all (n + k)-node R-NFT supergraphs of G. We survey prior results on the design of optimal k-NFT supergraphs of various useful forms of G; this work covers cycles and various types of trees. We also introduce the concept of exact node fault tolerance, which requires that every graph obtained by removing k nodes from G* be isomorphic to G, and explore its basic properties. We conclude with a discussion of some unsolved and partially solved problems. (C) 1996 John Wiley & Sons, Inc.
引用
收藏
页码:19 / 23
页数:5
相关论文
共 50 条
  • [1] Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
    Zak, Andrzej
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 299 - 306
  • [2] Fault tolerance in the arrangement graphs
    Wang, Shiying
    Feng, Kai
    THEORETICAL COMPUTER SCIENCE, 2014, 533 : 64 - 71
  • [3] Fault Tolerance of Cayley Graphs
    Shuhong Gao
    Beth Novick
    Annals of Combinatorics, 2007, 11 : 161 - 171
  • [4] Fault tolerance of cayley graphs
    Gao, Shuhong
    Novick, Beth
    ANNALS OF COMBINATORICS, 2007, 11 (02) : 161 - 171
  • [5] EDGE FAULT TOLERANCE IN GRAPHS
    HARARY, F
    HAYES, JP
    NETWORKS, 1993, 23 (02) : 135 - 142
  • [6] ON GROUP GRAPHS AND THEIR FAULT TOLERANCE
    AKERS, SB
    KRISHNAMURTHY, B
    IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (07) : 885 - 888
  • [7] Fault Tolerance of λ-Optimal Graphs
    Chen, Xing
    Xiong, Wei
    Meng, Jixiang
    ARS COMBINATORIA, 2018, 138 : 355 - 364
  • [8] The structure fault tolerance of arrangement graphs
    Zhang, Guozhen
    Wang, Dajin
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 400
  • [9] Conditional fault tolerance of arrangement graphs
    Zhou, Shuming
    Xu, Jun-Ming
    INFORMATION PROCESSING LETTERS, 2011, 111 (21-22) : 1037 - 1043
  • [10] Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs
    Huang, Yanze
    Lin, Limei
    Cheng, Eddie
    Xu, Li
    COMPUTER JOURNAL, 2023, 66 (05): : 1184 - 1194