A relationship between g-good-neighbour conditional diagnosability and g-good-neighbour connectivity in regular graphs. Issue 1 (2nd January 2018)

• Record Type: Journal Article
• Authors: Cheng, Dongqin
• Is Part Of: International journal of computer mathematics. Volume 3:Issue 1(2018)
• Page Start: 47
• Page End: 52
• Publication Date: 2018-01-02
• Subjects: g-good-neighbour conditional diagnosability -- g-good-neighbour connectivity -- PMC model -- MM* model -- regular graphs; 94C12 -- 94C15; Computer systems -- Periodicals; Computer systems; Periodicals; 004
• DOI: 10.1080/23799927.2018.1441187
• Languages: English
• ISSNs: 2379-9927

Abstract

ABSTRACT: 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.