A study of fault tolerance in star graph

Authors:
Shahram Latifi
Affiliations:
Department of Electrical & Computer Engineering, UNLV, Las Vegas, NV, USA
Venue:
Information Processing Letters
Year:
2007

Citing 5
Cited 5

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
On the fault-diameter of the star graph

Information Processing Letters
Embedding an Arbitrary Binary Tree into the Star Graph

IEEE Transactions on Computers
A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model

IEEE Transactions on Computers
Hyper hamiltonian laceability on edge fault star graph

Information Sciences: an International Journal

Robustness of star graph network under link failure

Information Sciences: an International Journal
Substar Reliability Analysis in Star Networks

Information Sciences: an International Journal
Improving bounds on link failure tolerance of the star graph

Information Sciences: an International Journal
Fault tolerance in bubble-sort graph networks

Theoretical Computer Science
Fault tolerance in k-ary n-cube networks

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

The bounds on f(n,k), the number of faulty nodes to make every (n-k)-dimensional substar S"n"-"k in an n-dimensional star network S"n, have been derived. The exact value for f(n,k) is determined when n is prime and k=2, or when n-2=