Name
Abstract | ||
|---|---|---|
Let G be a connected graph, F be a subset of V(G), S be a subset of E(G). The cyclic vertex connectivity of G, denoted by kappa(c)(G), is the minimum cardinality of F such that G-F is disconnected and at least two of its components contain cycles. The cyclic edge connectivity of G, denoted by lambda(c)(G), is the minimum cardinality of S such that G-S is disconnected and at least two of its components contain cycles. Let D-k,D- n denote the data center network. In this paper, we obtain the following results:kappa(c)(D-k,D-2) = 6k - 6 for k >= 2; kappa(c)(D-k,D-n) = n + 3k - 3 for k >= 2, n >= 3; lambda(c)c(D-k,D-2) = 6k - 6 for k >= 2; lambda(c)(D-2,D-n) = 2n for n >= 3; lambda(c)(D-k,D-n) = 3n + 3k - 9 for k >= 3, n >= 3. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1080/17445760.2021.1952579 | INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS |
Keywords | DocType | Volume |
Cyclic vertex connectivity, cyclic edge connectivity, data center network | Journal | 36 |
Issue | ISSN | Citations |
6 | 1744-5760 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongzhou Zhu | 1 | 0 | 0.34 |
| Jixiang Meng | 2 | 353 | 55.62 |