Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)

Article citations

More>>

Fan, J., Lin, X. and Jia, X. (2005) Optimal Path Embedding in Crossed Cubes. IEEE Transactions on Parallel and Distributed Systems, 16, 1190-1200. https://doi.org/10.1109/TPDS.2005.151

has been cited by the following article:

  • TITLE: Reliability Analysis of Crossed Cube Networks on Degree

    AUTHORS: Litao Guo

    KEYWORDS: Interconnection Structure, Fault Tolerance, Reliability, Conditional Connectivity

    JOURNAL NAME: Journal of Computer and Communications, Vol.6 No.1, December 29, 2017

    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 .