2-Restricted Edge Connectivity of Wheel Networks
Theg-restricted edge connectivity (g-REC) is an efficient index in evaluating the reliability and fault tolerance of large-scale processing systems. Assume that G=V,E is a simple connected graph and F⊆E. The g-REC of G, denoted by λgG, is the minimum F such that G−F is disconnected and any component...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2021/3725778 |
| Summary: | Theg-restricted edge connectivity (g-REC) is an efficient index in evaluating the reliability and fault tolerance of large-scale processing systems. Assume that G=V,E is a simple connected graph and F⊆E. The g-REC of G, denoted by λgG, is the minimum F such that G−F is disconnected and any component has at least g nodes. The n-dimensional wheel network CWn, a kind of Cayley graph, possesses many desired features. In this paper, we establish that λ2CWn is 4n−6 for n≥5, and CWn is λ2-optimal. |
|---|---|
| ISSN: | 1563-5147 |