Name
Abstract | ||
|---|---|---|
The connectivity plays an important role in measuring the fault tolerance and reliability of interconnection networks. The generalized k-connectivity of a graph G, denoted by kappa(k)(G), is an important indicator of a network's ability for fault tolerance and reliability. The bubble-sort star graph, denoted by BSn, is a well known interconnection network. In this paper, we show that kappa(3)(BSn) = 2n - 4 for n >= 3, that is, for any three vertices in BSn, there exist 2n - 4 internally disjoint trees connecting them in BSn, for n >= 3, which attains the upper bound of kappa(3)(G) <= delta(G) - 1 given by Li et al. for G = BSn. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1142/S0129054119500229 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Generalized connectivity, fault-tolerance, reliability, bubble-sort star graph | Discrete mathematics,Graph,Combinatorics,Bubble sort,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 5 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu-Li Zhao | 1 | 1 | 4.40 |
| Rongxia Hao | 2 | 165 | 26.11 |