TY - JOUR
T1 - On the g-good-neighbor connectivity of graphs
AU - Wang, Zhao
AU - Mao, Yaping
AU - Hsieh, Sun Yuan
AU - Wu, Jichang
N1 - Funding Information:
Supported by the National Science Foundation of China (Nos. 11601254, 11551001, 11161037, 61763041, 11661068, and 11461054) and the Science Found of Qinghai Province (Nos. and 2014-ZJ-907) and the Qinghai Key Laboratory of Internet of Things Project (2017-ZJ-Y21).
Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2020/1/12
Y1 - 2020/1/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85076213687&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85076213687&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2019.11.021
DO - 10.1016/j.tcs.2019.11.021
M3 - Article
AN - SCOPUS:85076213687
VL - 804
SP - 139
EP - 148
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -