Name
Abstract | ||
|---|---|---|
Fault tolerance of an (n,k)-star network is measured by its h-super connectivity κs(h) or h-super edge-connectivity λs(h). Li et al. (2014) [8], (2012) [6] determined κs(h) and λs(h) for 0≤h≤n−k. This paper determines that κs(h)=λs(h)=(h+1)!(n−h−1)(n−k)! for n−k≤h≤n−2. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.08.004 | Theoretical Computer Science |
Keywords | Field | DocType |
Combinatorial problems,Fault-tolerant analysis,(n,k)-Star graphs,Connectivity,h-Super connectivity | Discrete mathematics,Combinatorics,Star network,Mathematics | Journal |
Volume | ISSN | Citations |
704 | 0304-3975 | 2 |
PageRank | References | Authors |
0.37 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang-Jun Li | 1 | 51 | 4.37 |
| Yong-Ni Guan | 2 | 2 | 0.37 |
| Zheng Yan | 3 | 2 | 1.04 |
| Jun-ming Xu | 4 | 671 | 53.22 |