Journal of Computer and Communications

Volume 6, Issue 1 (January 2018)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.35  Citations  

Reliability Analysis of Crossed Cube Networks on Degree

HTML  XML Download Download as PDF (Size: 230KB)  PP. 129-134  
DOI: 10.4236/jcc.2018.61014    472 Downloads   754 Views  
Author(s)

ABSTRACT

Crossed cubes network is a kind of interconnection structure as a basis for distributed memory parallel computer architecture. Reliability takes an important role in fault tolerant computing on multiprocessor systems. Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. The k-conditional edge connectivity is the cardinality of the minimum edge cuts , if any, whose deletion disconnects and each component of has property of minimum degree . The k-conditional connectivity can be defined similarly. In this paper, we determine the k- conditional (edge) connectivity of crossed cubes for small k. And we also prove other properties of .

Share and Cite:

Guo, L. (2018) Reliability Analysis of Crossed Cube Networks on Degree. Journal of Computer and Communications, 6, 129-134. doi: 10.4236/jcc.2018.61014.

Cited by

No relevant information.

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.