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(G)≤n−2g−2 for [Formula presented], and graphs with κg(G)=1,2 and trees with κg(Tn)=n−t for [Formula presented] are characterized, respectively. In the end, we get the three extremal results for the g-good-neighbor connectivity.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)