The diagnosability of triangle-free graphs

被引:21
|
作者
Lin, Cheng-Kuan [1 ,2 ]
Teng, Yuan-Hsiang [3 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Peoples R China
[2] Acad Sinica, Inst Informat Sci, Taipei 11529, Taiwan
[3] Hungkuang Univ, Dept Comp Sci & Informat Engn, Taichung 433, Taiwan
关键词
Diagnosability; Local diagnosis; PMC model; Triangle-free graphs; STAR; ALGORITHM;
D O I
10.1016/j.tcs.2014.02.024
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The local diagnosability concerns the local connective substructure in a network. The PMC model is the test-based diagnosis with a processor performing the diagnosis by testing the neighboring processors via the links between them. In this paper, we discuss the diagnosability and the local diagnosability of a triangle-free network under the PMC model. We also propose the local diagnosis algorithms under the PMC model for some specific structures. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:58 / 65
页数:8
相关论文
共 50 条
  • [41] Eigenvalue multiplicity in triangle-free graphs
    Rowlinson, Peter
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 493 : 484 - 493
  • [42] The number of the maximal triangle-free graphs
    Balogh, Jozsef
    Petrickova, Sarka
    [J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2014, 46 : 1003 - 1006
  • [43] Coloring triangle-free graphs on surfaces
    Dvorak, Zdenek
    Kral, Daniel
    Thomas, Robin
    [J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 2 - +
  • [44] The Generation of Maximal Triangle-Free Graphs
    Stephan Brandt
    Gunnar Brinkmann
    Thomas Harmuth
    [J]. Graphs and Combinatorics, 2000, 16 (2) : 149 - 157
  • [45] Induced trees in triangle-free graphs
    Matousek, Jiri
    Samal, Robert
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [46] Structure and colour in triangle-free graphs
    Aravind, N. R.
    Cambie, Stijn
    van Batenburg, Wouter Cames
    de Verclos, Remi De Joannis
    Kang, Ross J.
    Patel, Viresh
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
  • [47] The generation of maximal triangle-free graphs
    Brandt, S
    Brinkmann, G
    Harmuth, T
    [J]. GRAPHS AND COMBINATORICS, 2000, 16 (02) : 149 - 157
  • [48] THE χ-RAMSEY PROBLEM FOR TRIANGLE-FREE GRAPHS
    Davies, Ewan
    Illingworth, Freddie
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (02) : 1124 - 1134
  • [49] Triangle-free graphs and forbidden subgraphs
    Brandt, S
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) : 25 - 33
  • [50] BIPARTITE SUBGRAPHS OF TRIANGLE-FREE GRAPHS
    POLJAK, S
    TUZA, Z
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (02) : 307 - 313