PROJECT TITLE :

The g -Good-Neighbor Conditional Diagnosability of Arrangement Graphs - 2018

ABSTRACT:

A network's diagnosability is the utmost range of faulty vertices the network can discriminate solely by performing mutual tests among the vertices. It is an vital live of a network's robustness. The original diagnosability while not any condition is typically rather low as a result of it is bounded by the network's minimum degree. Many conditional diagnosability have been proposed within the past to extend the allowed faulty vertices, and hence enhancing the diagnosability of the network. The g-sensible-neighbor conditional diagnosability is the most number of faulty vertices a network will guarantee to spot, under the condition that each fault-free vertex has at least g fault-free neighbors (i.e., smart neighbors). During this Project, we establish the g-sensible-neighbor conditional diagnosability for the (n; k)-arrangement graph network A n;k . We have a tendency to can show that, under both the PMC model and the comparison model, the A n;k 's g-good-neighbor conditional diagnosability is [(g + 1)k - g](n - k), which will be many times higher than the A n;k 's original diagnosability.