China 
Africa 
Explore chapters and articles related to this topic
Introduction
Published in Vlad P. Shmerko, Svetlana N. Yanushkevich, Sergey Edward Lyshevski, Computer Arithmetics for Nanoelectronics, 2018
Vlad P. Shmerko, Svetlana N. Yanushkevich, Sergey Edward Lyshevski
The fundamental aspects of hypercube graph theory are discussed by Cormen et al. and Saad et al. in [6] and [38], respectively. The properties of the different topologies are studied in a number of papers, in particular, by Becker et al. [1], Ohring et al. [35], Shen et al. [40], and Wagner [48].
Introduction to Graph Models
Published in Jonathan L. Gross, Jay Yellen, Mark Anderson, Graph Theory and Its Applications, 2018
Jonathan L. Gross, Jay Yellen, Mark Anderson
definition: The hypercube graph Qn is the n-regular graph whose vertex-set is the set of bitstrings of length n, such that there is an edge between two vertices if and only if they differ in exactly one bit.
A general approach to deriving diagnosability results of interconnection networks*
Published in International Journal of Parallel, Emergent and Distributed Systems, 2022
Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen
The rest of this paper proceeds as follows: In Section 2, after presenting basic notions, we provide a general derivation to an existing result between various notions of diagnosability, and derive several related results, which were justified separately in [25], to set the stage for Section 3, where we summarise a general process of deriving diagnosability results shared by both the g-good-neighbour and the g-extra fault-tolerant models, in terms of either the PMC, or the MM*, model. We demonstrate the value, and applicability, of this general process by deriving the g-extra diagnosability of the hypercube graph in Section 4, that of the -star graph in Section 5, and that of the arrangement graph in Section 6. We conclude this paper in Section 7.
The g-good-neighbour conditional diagnosability of enhanced hypercube under PMC model
Published in International Journal of Parallel, Emergent and Distributed Systems, 2020
Hui Yu, Yanze Huang, Limei Lin, Jin'e Li, Riqing Chen
Tzeng [5] proposed the -enhanced hypercube graph , which gives smaller diameter and a low vertex distance compares to the hypercube.