Optimal design of diagnosable systems on networks constructed by graph operations
Toru Araki, Yukio Shibata · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 2002
Abstract In this paper, we consider self‐diagnosable systems on computer networks, known as one‐step t‐fault diagnosable systems introduced by Preparata and colleagues. In order to give network topologies, some graph operations such as the Cartesian product, the Kronecker product, and the line digraph operation are utilized. We study the diagnosability of networks constructed by the graph operations based on the idea of “highly structured system,” and then present some optimal networks. © 2002 Scripta Technica, Electron Comm Jpn Pt 3, 85(5): 1–9, 2002