Answers are grounded in this paper and cite their sources.
Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network G. In 1996, Fàbrega and Fiol proposed the g-good-neighbor connectivity of G. In this paper, we show that 1≤ κᵍ(G)≤ n-2g-2 for 0≤ g≤ \Δ(G), n-3/2\, and graphs with κᵍ(G)=1,2 and trees with κᵍ(Tₙ)=n-t for 4≤ t≤ n+2/2 are characterized, respectively. In the end, we get the three extremal results for the g-good-neighbor connectivity.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2019) studied this question.