Reliability Evaluation of Star Graphs in Terms of Extra Edge Connectivity

Author(s):  
Ming-Chien Yang

2018 ◽  
Vol 67 (1) ◽  
pp. 297-307 ◽  
Author(s):  
Mingzu Zhang ◽  
Lianzhu Zhang ◽  
Xing Feng ◽  
Hong-Jian Lai




2021 ◽  
Vol 32 (02) ◽  
pp. 137-149
Author(s):  
Litao Guo ◽  
Mingzu Zhang ◽  
Shaohui Zhai ◽  
Liqiong Xu

Reliability of interconnection networks is important to design multiprocessor systems. The extra edge connectivity and component edge connectivity are two parameters for the reliability evaluation. The [Formula: see text]-extra edge connectivity [Formula: see text] is the cardinality of the minimum extra edge cut [Formula: see text] such that [Formula: see text] is not connected and each component of [Formula: see text] has at least [Formula: see text] vertices. The [Formula: see text]-component edge connectivity [Formula: see text] of a graph [Formula: see text] is the minimum edge number of a set [Formula: see text] such that [Formula: see text] is not connected and [Formula: see text] has at least [Formula: see text] components. In this paper, we find the relation of extra edge connectivity and component edge connectivity for regular networks. As an application, we determine the component edge connectivity of BC networks, [Formula: see text]-ary [Formula: see text]-cubes, enhanced hypercubes.



2014 ◽  
Vol 63 (10) ◽  
pp. 2540-2548 ◽  
Author(s):  
Weihua Yang ◽  
Huiqiu Lin


Author(s):  
Mingzu Zhang ◽  
Xiaoli Yang ◽  
Xiaomin He ◽  
Zhuangyan Qin ◽  
Yongling Ma

The [Formula: see text]-dimensional augmented cube [Formula: see text], proposed by Choudum and Sunitha in 2002, is one of the most famous interconnection networks of the distributed parallel system. Reliability evaluation of underlying topological structures is vital for fault tolerance analysis of this system. As one of the most extensively studied parameters, the [Formula: see text]-conditional edge-connectivity of a connected graph [Formula: see text], [Formula: see text], is defined as the minimum number of the cardinality of the edge-cut of [Formula: see text], if exists, whose removal disconnects this graph and keeps each component of [Formula: see text] having minimum degree at least [Formula: see text]. Let [Formula: see text], [Formula: see text] and [Formula: see text] be three integers, where [Formula: see text], if [Formula: see text] and [Formula: see text], if [Formula: see text]. In this paper, we determine the exact value of the [Formula: see text]-conditional edge-connectivity of [Formula: see text], [Formula: see text] for each positive integer [Formula: see text] and [Formula: see text], and give an affirmative answer to Shinde and Borse’s corresponding conjecture on this topic in [On edge-fault tolerance in augmented cubes, J. Interconnection Netw. 20(4) (2020), DOI:10.1142/S0219265920500139].



1999 ◽  
Vol 146 (6) ◽  
pp. 626 ◽  
Author(s):  
L.R. Castro Ferreira ◽  
P.A. Crossley ◽  
J. Goody ◽  
R.N. Allan


2013 ◽  
Vol 51 (7) ◽  
pp. 523-527 ◽  
Author(s):  
Su-Jeong Suh ◽  
Chang-Hyoung Lee ◽  
Young-Lae Cho ◽  
Hwa-Sun Park ◽  
Won-Pyo Lee ◽  
...  


2017 ◽  
Vol 12 (2) ◽  
pp. 142
Author(s):  
Hemakumar Reddy Galiveeti ◽  
Arup Kumar Goswami ◽  
Nalin B. Dev Choudhury


Sign in / Sign up

Export Citation Format

Share Document