Reliability analysis of godan graphs

DOI10.1016/j.dam.2021.10.022zbMath1478.68022OpenAlexW3212296568MaRDI QIDQ2057605

Yunxia Ren, Shi-ying Wang

Publication date: 7 December 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.10.022

zbMATH Keywords

graphconnectivityinterconnection networkdiagnosability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (4)

Fault tolerance of composite graph based on disc-ring and folded hypercube ⋮ The generalized 3-connectivity of burnt pancake graphs and godan graphs ⋮ Component Connectivity of Alternating Group Networks and Godan Graphs ⋮ Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien's model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks
• The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
• Fault-tolerance of \((n, k)\)-star networks
• Edge fault tolerance of graphs with respect to super edge connectivity
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault
• The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) model
• Edge-cuts leaving components of order at least three
• Super restricted edge-connectivity of graphs with diameter 2
• The \(g\)-extra connectivity and diagnosability of crossed cubes
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• A sufficient condition for graphs to be super \(k\)-restricted edge connected
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes
• Neighborhood conditions for graphs to be super restricted edge connected
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
• (t,k)-Diagnosis for Component-Composition Graphs under the MM* Model
• The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model

This page was built for publication: Reliability analysis of godan graphs