A relationship between g-good-neighbour conditional diagnosability and g-good-neighbour connectivity in regular graphs
Dongqin Cheng · International Journal of Computer Mathematics Computer Systems Theory · 2018
In a system , the g-good-neighbour conditional diagnosability is the maximum t such that G is g-good-neighbour t-fault-diagnosable. The g-good-neighbour connectivity is the minimum cardinality of faulty set such that and G−F is disconnected. Under the following three conditions: (1) for any subset , if , then ; (2) there is a subset A of with and such that is a minimum g-good-neighbour faulty set and is a g-good-neighbour faulty set; (3) ; in this paper, we find that holds for k-regular graph G under both PMC model and MM* model, where and g is an integer.