期刊
THEORETICAL COMPUTER SCIENCE
卷 790, 期 -, 页码 66-79出版社
ELSEVIER
DOI: 10.1016/j.tcs.2019.04.028
关键词
Hierarchical cubic networks; g-extra connectivity; g-extra conditional diagnosability
Connectivity and diagnosability are important parameters in measuring the fault-tolerance and reliability of interconnection networks. Given a graph G and a non-negative integer g, the g-extra connectivity of G, denoted by kappa(g)(G), is the minimum cardinality of a set of vertices of G, if it exists, whose deletion disconnects G, and every remaining component has more than g vertices. The g-extra conditional diagnosability t(g)(G) of a graph G is the maximum value of t such that G is g-extra conditional t-diagnosable. The n-dimensional hierarchical cubic network HCNn was proposed by Ghose and Desai [12] as a hypercube-based topology while preserving its attractive features. For n >= 5, we first determine Kg(HCNn) for 0 <= g <= n + 1, then establish t(g)(HCNn) under the PMC model for 0 <= g <= n + 1, and t(g)(HCNn) under the MM* model for 0 <= g <= n-1/3. respectively. (C) 2019 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据