超立方体
组合数学
k-最近邻算法
集合(抽象数据类型)
顶点(图论)
容错
计算机科学
数学
度量(数据仓库)
离散数学
图形
数据挖掘
分布式计算
人工智能
程序设计语言
作者
Shumin Zhang,Ting Tian,Yalan Li,Chengfu Ye
标识
DOI:10.1080/23799927.2024.2307409
摘要
In order to better measure the fault tolerance and reliability of a network, Yuan et al. introduced the non-inclusive g-good-neighbor diagnosability of a network. The g-good-neighbor faulty set is a special faulty set, which satisfies that every fault-free vertex has at least g fault-free neighbors. The non-inclusive g-good-neighbor diagnosability requires every pair of g-good-neighbor faulty sets is non-inclusive, denoted as tNg(G). In the paper, we study the non-inclusive g-good-neighbor diagnosability of hypercubes, and obtain tNg(Qn)=(n−1−g)2g+1+2g−1 for g∈{1,2} under the PMC model, tN1(Qn)=3n−5, tN2(Qn)=8n−21 under the MM* model.
科研通智能强力驱动
Strongly Powered by AbleSci AI