Jan 8, 2024 · In this paper, we establish some relationships between g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph ...

In this paper, we establish some relationships between connectivity, diagnosalility, g-good-neighbor connectivity and g-good-neighbor (respectively, g-good- ...

In this paper, we establish some relationships between connectivity, diagnosability, g-good-neighbor connectivity and g-good-neighbor (respectively, g-good-in- ...

Dec 9, 2024 · In order to study the cognitive networks, the multilevel k-way partitioning methods and the coarsening strategies for graphs are studied. The ...

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

In this paper, we establish some relationships between connectivity, diagnosalility, g-good-neighbor connectivity and g-good-neighbor (respectively, g-good-in- ...

The problems of g-good-neighbor diagnosability of many well-known networks under the PMC model and MM∗ model have been widely explored. In this paper, we study ...

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

A g-good-neighbor cut of G is a g-good-neighbor faulty set F such that G−F is disconnected. The minimum cardinality of g-good-neighbor cuts is said to be the g ...

May 24, 2019 · (2) If G is a g-extra and g-good-neighbor connected graph, then κg(G) ≤ κg(G). The range of the integer g can be determined immediately.