2-Restricted Edge Connectivity of Wheel Networks

Wei Feng and Shiying Wang

Mathematical Problems in Engineering, 2021, vol. 2021, 1-5

Abstract:

The - restricted edge connectivity ( - REC) is an efficient index in evaluating the reliability and fault tolerance of large-scale processing systems. Assume that is a simple connected graph and . The - REC of , denoted by , is the minimum such that is disconnected and any component has at least nodes. The - dimensional wheel network , a kind of Cayley graph, possesses many desired features. In this paper, we establish that is for , and is - optimal.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/3725778.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/3725778.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3725778

DOI: 10.1155/2021/3725778

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().