On the g-good-neighbor connectivity of graphs

Zhao Wang; Yaping Mao; Sun Yuan Hsieh; Jichang Wu

doi:10.1016/j.tcs.2019.11.021

On the g-good-neighbor connectivity of graphs

Zhao Wang
, Yaping Mao
, Sun Yuan Hsieh
, Jichang Wu

研究成果: Article › 同行評審

16 引文斯高帕斯（Scopus）

摘要

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(T_n)=n−t for [Formula presented] are characterized, respectively. In the end, we get the three extremal results for the g-good-neighbor connectivity.

原文	English
頁（從 - 到）	139-148
頁數	10
期刊	Theoretical Computer Science
卷	804
DOIs	https://doi.org/10.1016/j.tcs.2019.11.021
出版狀態	Published - 2020 1月 12

All Science Journal Classification (ASJC) codes

理論電腦科學
一般電腦科學

存取文件

10.1016/j.tcs.2019.11.021

其它文件與鏈接

引用此

@article{f60333707e13447da620f46f1f6706ab,

title = "On the g-good-neighbor connectivity of graphs",

abstract = "Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network G. In 1996, F{\`a}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.",

author = "Zhao Wang and Yaping Mao and Hsieh, \{Sun Yuan\} and Jichang Wu",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2020",

month = jan,

day = "12",

doi = "10.1016/j.tcs.2019.11.021",

language = "English",

volume = "804",

pages = "139--148",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - On the g-good-neighbor connectivity of graphs

AU - Wang, Zhao

AU - Mao, Yaping

AU - Hsieh, Sun Yuan

AU - Wu, Jichang

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 - https://www.scopus.com/pages/publications/85076213687

UR - https://www.scopus.com/pages/publications/85076213687#tab=citedBy

U2 - 10.1016/j.tcs.2019.11.021

DO - 10.1016/j.tcs.2019.11.021

M3 - Article

AN - SCOPUS:85076213687

SN - 0304-3975

VL - 804

SP - 139

EP - 148

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

On the g-good-neighbor connectivity of graphs

摘要

All Science Journal Classification (ASJC) codes

存取文件

其它文件與鏈接

指紋

引用此