标题:On the g-good-neighbor connectivity of graphs
作者:Wang, Zhao; Mao, Yaping; Hsieh, Sun-Yuan; Wu, Jichang
作者机构:[Wang, Zhao] China Jiliang Univ, Coll Sci, Hangzhou 310018, Peoples R China.; [Mao, Yaping] Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qin 更多
通讯作者:Mao, Yaping;Mao, YP;Mao, YP
通讯作者地址:[Mao, YP]Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China;[Mao, YP]Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai 更多
来源:THEORETICAL COMPUTER SCIENCE
出版年:2020
卷:804
页码:139-148
DOI:10.1016/j.tcs.2019.11.021
关键词:Connectivity; g-good-neighbor connectivity; Extremal problem
摘要:Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network G. In 1996, Fabrega and Fiol proposed the g-good-neighbor connectivity of G. In this paper, we show that 1 <= kappa(g)(G) <= n - 2g - 2 for 0 <= g <= {Delta(G), left perpendicular n-3/2 right perpendicular}, and graphs with kappa(g)(G) = 1, 2 and trees with kappa(g)(T-n) = 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. (C) 2019 Elsevier B.V. All rights reserved.
收录类别:EI;SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076213687&doi=10.1016%2fj.tcs.2019.11.021&partnerID=40&md5=69ecd3ec73062a6dbe86f278c3b7fc54
TOP