The conditional fault diagnosability of \((n, k)\)-star graphs

From MaRDI portal
Publication:440955

DOI10.1016/J.AMC.2012.03.021zbMath1245.05122OpenAlexW2009913380MaRDI QIDQ440955

Shuming Zhou

Publication date: 19 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.03.021




Related Items (25)

Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphsFault-tolerance of \((n, k)\)-star networksOn the conditional diagnosability of matching composition networksRelating the extra connectivity and the conditional diagnosability of regular graphs under the comparison modelOn \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networksFractional Matching Preclusion for (n,k)-Star GraphsFault diagnosability of data center networksConditional diagnosability of arrangement graphs under the PMC modelAn approach to conditional diagnosability analysis under the PMC model and its application to torus networksAn algorithm for conditional-fault local diagnosis of multiprocessor systems under the \(\mathrm{MM}^\ast\) modelOn conditional fault tolerance and diagnosability of hierarchical cubic networksA tree structure for local diagnosis in multiprocessor systems under the comparison modelReliability of \((n,k)\)-star network based on \(g\)-extra conditional faultHybrid fault diagnosis capability analysis of regular graphsConditional diagnosability of Cayley graphs generated by wheel graphs under the PMC modelConditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositionsA survey for conditional diagnosability of alternating group networksThe \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphsResearches for more reliable arrangement graphs in multiprocessor computer systemMeasurement and algorithm for conditional local diagnosis of regular networks under the \(\mathrm{MM}^\ast\) modelConditional diagnosability and strong diagnosability of shuffle-cubes under the comparison modelMaximum independent sets partition of \((n, k)\)-star graphsThe \(h\)-edge tolerable diagnosability of balanced hypercubesPancake graphs: structural properties and conditional diagnosabilityFault tolerance and diagnosability of burnt pancake networks under the comparison model




Cites Work




This page was built for publication: The conditional fault diagnosability of \((n, k)\)-star graphs