The 2-Extra Connectivity of Wheel Networks

Feng, Wei; Wang, Shiying

doi:10.1155/2020/8910240

Search citation statements

Order By: Relevance

Paper Sections

Select...

E Wheel Network1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2023

Publication Types

Select...

Article5

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 6 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, CW n is also a desirable processing model. CW n is studied by many researchers [13,14,[17][18][19][20][21][22][23][24][25]. CW n for n � 4 has been depicted in Figure 1.…”

Section: E Wheel Networkmentioning

confidence: 99%

2-Restricted Edge Connectivity of Wheel Networks

Feng

Wang

2021

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

The g -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 λ g G , is the minimum F such that G − F is disconnected and any component has at least g nodes. The n -dimensional wheel network CW n , a kind of Cayley graph, possesses many desired features. In this paper, we establish that λ 2 CW n is 4 n − 6 for n ≥ 5 , and CW n is λ 2 -optimal.

show abstract

“…Hence, CW n is also a desirable processing model. CW n is studied by many researchers [13,14,[17][18][19][20][21][22][23][24][25]. CW n for n � 4 has been depicted in Figure 1.…”

Section: E Wheel Networkmentioning

confidence: 99%