On the g-good-neighbor connectivity of graphs

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

Research output: Contribution to journalArticlepeer-review

4 Citations (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.

Original languageEnglish
Pages (from-to)139-148
Number of pages10
JournalTheoretical Computer Science
Publication statusPublished - 2020 Jan 12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On the g-good-neighbor connectivity of graphs'. Together they form a unique fingerprint.

Cite this