Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network

Abstract

In 2020, Lin and Zhang proposed the concept of g-good-neighbor (respectively, g-good-in-neighbor, g-good-out-neighbor) connectivity of digraphs and their respective diagnosability under PMC model. In this paper, we establish some relationships between connectivity, diagnosability, g-good-neighbor connectivity and g-good-neighbor (respectively, g-good-in-neighbor, g-good-out-neighbor) diagnosability of strong digraph networks. As an application, we use these relationships to obtain g-good-out-neighbor and 1-good-neighbor (respectively, 1-good-in-neighbor) diagnosability of some well-known strong digraph networks.