On the g-good-neighbor connectivity of graphs

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

研究成果: Article

摘要

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.

原文English
頁(從 - 到)139-148
頁數10
期刊Theoretical Computer Science
804
DOIs
出版狀態Published - 2020 一月 12

指紋

Connectivity
Graph in graph theory
Diagnosability
Interconnection Networks
Fault-tolerant
Two Parameters

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

引用此文

Wang, Zhao ; Mao, Yaping ; Hsieh, Sun Yuan ; Wu, Jichang. / On the g-good-neighbor connectivity of graphs. 於: Theoretical Computer Science. 2020 ; 卷 804. 頁 139-148.
@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",
year = "2020",
month = "1",
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",

}

On the g-good-neighbor connectivity of graphs. / Wang, Zhao; Mao, Yaping; Hsieh, Sun Yuan; Wu, Jichang.

於: Theoretical Computer Science, 卷 804, 12.01.2020, p. 139-148.

研究成果: Article

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 - 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 -