Improving bounds on link failure tolerance of the star graph

  • Authors:

  • David Walker;Shahram Latifi

  • Affiliations:

  • Department of Electrical and Computer Engineering, UNLV, Las Vegas, NV 89154-4026, United States;Department of Electrical and Computer Engineering, UNLV, Las Vegas, NV 89154-4026, United States

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

Abstract

Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-star graph S"n"-"k faulty in an n-dimensional star network S"n, has been the subject of several studies. Bounds on f(n,k) have already been derived, and it is known that f(n,1)=n+2. Here, we improve the bounds on f(n,k). Specifically, it is shown that f(n,k)=