Improving bounds on link failure tolerance of the star graph

DOI10.1016/j.ins.2010.03.002zbMath1211.68293OpenAlexW2039545958MaRDI QIDQ985078

J. Martínez

Publication date: 20 July 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.03.002

zbMATH Keywords

reliabilitydistributed systemspermutationinterconnection networksstar graphlink failure

Mathematics Subject Classification ID

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

Related Items (17)

The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Subnetwork Preclusion of (n,k)-Star Networks ⋮ Diagnosability of star graphs with missing edges ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Measuring the impact of MVC attack in large complex networks ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Independent spanning trees on even networks ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ The panpositionable panconnectedness of augmented cubes ⋮ Researches for more reliable arrangement graphs in multiprocessor computer system ⋮ Conditional fault tolerance in a class of Cayley graphs ⋮ Fault tolerance in bubble-sort graph networks ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Structure connectivity and substructure connectivity of star graphs ⋮ Link Failure Tolerance in the Arrangement Graphs ⋮ Subnetwork preclusion for bubble-sort networks

Cites Work

• Hyper Hamiltonian laceability on edge fault star graph
• A study of fault tolerance in star graph
• Substar reliability analysis in star networks
• How robust is the n-cube?
• On the fault-diameter of the star graph
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Robustness of star graph network under link failure
• A group-theoretic model for symmetric interconnection networks
• Embedding an arbitrary binary tree into the star graph
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model

This page was built for publication: Improving bounds on link failure tolerance of the star graph