On the g-good-neighbor connectivity of graphs

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

研究成果: Article同行評審

4 引文 斯高帕斯(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(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 1月 12

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「On the g-good-neighbor connectivity of graphs」主題。共同形成了獨特的指紋。

引用此