|
| DIAGNOSABILITY OF CAYLEY GRAPH NETWORKS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL |
| Mujiangshan Wang,Shiying Wang |
| (School of Electrical Engineering & Computer Science, The University of Newcastle NSW 2308, Australia;Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control, School of Math. and Information Science, Henan Normal University, Xinxiang, Henan 453007, PR China) |
| DOI： |
| Abstract: |
| Diagnosability of a multiprocessor system is one important study topic. Cayley graph network $Cay(T_{n},S_{n})$ generated by transposition trees $T_{n}$ is one of the attractive underlying topologies for the multiprocessor system. In this paper, it is proved that diagnosability of $Cay(T_{n},S_{n})$ is $n-1$ under the comparison diagnosis model for $n\geq 4$. |
| Key words: interconnection network; graph; diagnosability; comparison diagnosis model; Cayley graph |