One node fault tolerance for caterpillars and starlike trees

被引:6
|
作者
Harary, F [1 ]
Khurrum, M [1 ]
机构
[1] NEW MEXICO STATE UNIV,DEPT ELECT & COMP ENGN,LAS CRUCES,NM 88003
关键词
caterpillar; edge cost; fault tolerance; spare node; starlike tree;
D O I
10.1080/00207169508804394
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a given tree T with n nodes, we say that a supergraph G tolerates T (having one faulty node) if for each node u of G the subgraph G-u contains T up to isomorphism. Then G tolerates T optimally if G has just one new node and no supergraph of T with n + 1 nodes having fewer edges than G tolerates T. The one-node fault tolerance edge cost of T is the number of new edges in G. We derive theorems which determine this cost exactly for two type of trees, namely, caterpillar and starlike trees.
引用
收藏
页码:135 / 143
页数:9
相关论文
共 50 条
  • [41] Ordering Starlike Trees by the Totality of Their Spectral Moments
    Dragan Stevanović
    Order, 2022, 39 : 77 - 94
  • [42] Some results on starlike trees and sunlike graphs
    Lepović, Mirko
    Journal of Applied Mathematics and Computing, 2003, 11 (1-2) : 109 - 122
  • [43] T-irreducible Extensions for Starlike Trees
    Osipov, D. Yu
    IZVESTIYA SARATOVSKOGO UNIVERSITETA NOVAYA SERIYA-MATEMATIKA MEKHANIKA INFORMATIKA, 2015, 15 (03): : 330 - 339
  • [44] Spectral characterization of line graphs of starlike trees
    Zhou, Jiang
    Bu, Changjiang
    LINEAR & MULTILINEAR ALGEBRA, 2013, 61 (08): : 1041 - 1050
  • [45] Constructing trees with graceful labelings using caterpillars
    Lapierre, Luc
    McGuinness, Sean
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 94 : 313 - 321
  • [46] Some results on symmetric double starlike trees
    Lazić M.
    J. Appl. Math. Comp., 2006, 1-2 (215-222): : 215 - 222
  • [47] Higher order connectivity index of starlike trees
    Rada, J
    Araujo, O
    DISCRETE APPLIED MATHEMATICS, 2002, 119 (03) : 287 - 295
  • [48] STARLIKE TREES WHICH SPAN A HYPERCUBE.
    Harary, Frank
    Lewinter, Martin
    Computers & mathematics with applications, 1986, 15 (04): : 299 - 302
  • [49] Analyzing the techniques that improve fault tolerance of aggregation trees in sensor networks
    Chitnis, Laukik
    Dobra, Alin
    Ranka, Sanjay
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2009, 69 (12) : 950 - 960
  • [50] Maintaining Quality of Service with Dynamic Fault Tolerance in Fat-Trees
    Sem-Jacobsen, Frank Olaf
    Skeie, Tor
    HIGH PERFORMANCE COMPUTING - HIPC 2008, PROCEEDINGS, 2008, 5374 : 451 - 464