Robustness of star graph network under link failure
From MaRDI portal
Publication:2466079
DOI10.1016/J.INS.2007.09.013zbMath1126.68323OpenAlexW1981153478MaRDI QIDQ2466079
Xialong Wu, Ebrahim Saberinia, Shahram Latifi
Publication date: 11 January 2008
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.09.013
Network design and communication in computer systems (68M10) 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 (22)
Network robustness and random processes ⋮ The largest component of faulty star graphs ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees ⋮ Subnetwork Preclusion of (n,k)-Star Networks ⋮ Diagnosability of star graphs with missing edges ⋮ Substar reliability analysis in star networks ⋮ 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 ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ A new performance measure for characterizing fault rings in interconnection networks ⋮ The triangular pyramid: Routing and topological properties ⋮ Improving bounds on link failure tolerance of the star graph ⋮ Properties of a hierarchical network based on the star graph ⋮ Researches for more reliable arrangement graphs in multiprocessor computer system ⋮ Conditional fault tolerance in a class of Cayley graphs ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ Fault tolerance in bubble-sort graph networks ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley 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
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- A comparative study of job allocation and migration in the pancake network
- How robust is the n-cube?
- On the fault-diameter of the star graph
- 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: Robustness of star graph network under link failure