Bibliographic Details
| Title: |
The non-inclusive component diagnosability of hypercubes. |
| Authors: |
Li, Yalan1,2 (AUTHOR) liyalan2017@163.com, Han, Yulin1 (AUTHOR) |
| Source: |
Discrete Applied Mathematics. Oct2026, Vol. 391, p146-151. 6p. |
| Subjects: |
Hypercubes, Fault diagnosis, Graph theory, Mathematical connectedness, Fault tolerance (Engineering) |
| Abstract: |
Connectivity and diagnosability are crucial parameters for measuring the fault tolerance of a graph. The g -component connectivity c k g (G) of a graph G is defined as the minimum number of vertices whose removal results in a graph with at least g components. The non-inclusive g -component conditional diagnosability c t N g (G) refers to the maximum number of faulty vertices that can be reliably identified under the condition that the remaining subgraph (obtained by excluding the faulty vertices) contains at least g components. In this paper, we investigate the non-inclusive (g + 1) -component conditional diagnosability c t N g + 1 (G) in the scenario of large-scale faulty vertices. Specifically, we derive several key results regarding c t N g + 1 (G) for hypercube graphs under the PMC model and MM* model, respectively. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
