Diagnosability of Cayley Graph Networks Generated by Transposition Trees Under the Comparison Diagnosis Model

Diagnosability of Cayley Graph Networks Generated by Transposition Trees Under the Comparison Diagnosis Model

Year:    2016

Author:    Mujiangshan Wang, Shiying Wang

Annals of Applied Mathematics, Vol. 32 (2016), Iss. 2 : pp. 166–173

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 ≥ 4.$

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2016-AAM-20635

Annals of Applied Mathematics, Vol. 32 (2016), Iss. 2 : pp. 166–173

Published online:    2016-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    8

Keywords:    interconnection network graph diagnosability comparison diagnosis model Cayley graph.

Author Details

Mujiangshan Wang

Shiying Wang