Reliability analysis of godan graphs
type: Item
instance of: scholarly article
title: Reliability analysis of godan graphs
zbMATH Open document ID: 1478.68022
author: Yunxia Ren
author: Shiying Wang
published in: Discrete Applied Mathematics
publication date: 2021-12-07T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7439562
zbMATH Keywords: interconnection network
zbMATH Keywords: graph
zbMATH Keywords: connectivity
zbMATH Keywords: diagnosability
MaRDI profile type: Publication
full work available at URL: j.dam.2021.10.022
OpenAlex ID: W3212296568
cites work: Q5422499
cites work: Edge-cuts leaving components of order at least three
cites work: (t,k)-Diagnosis for Component-Composition Graphs under the MM* Model
cites work: An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
cites work: Q3119325
cites work: Edge fault tolerance of graphs with respect to super edge connectivity
cites work: The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
cites work: Q4044675
cites work: Fault-tolerance of \((n, k)\)-star networks
cites work: Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault
cites work: Edge cuts leaving components of order at least \(m\)
cites work: Super restricted edge-connectivity of graphs with diameter 2
cites work: The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
cites work: Neighborhood conditions for graphs to be super restricted edge connected
cites work: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
cites work: The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
cites work: The \(g\)-extra connectivity and diagnosability of crossed cubes
cites work: A sufficient condition for graphs to be super \(k\)-restricted edge connected
cites work: The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) model
cites work: Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
cites work: \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks
cites work: Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
cites work: Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes
cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity
DOI: 10.1016/J.DAM.2021.10.022
Recommended article: Q4260012
Recommended article: An algorithm for reliability analysis of planar graphs
Recommended article: Note on reliability evaluation of arrangement graphs
Recommended article: Q3824325
Recommended article: Q3821913
Recommended article: Q4347272
Recommended article: On the split reliability of graphs
Recommended article: On reliability of graphs with node failures
Recommended article: Q3337184
Recommended article: Reliability evaluation of complete graph-based recursive networks
description: scientific article; zbMATH DE number 7439562