Conditional connectivity of star graph networks under embedding restriction

  • Authors:

  • Yuxing Yang;Shiying Wang

  • Affiliations:

  • School of Computer and Information Engineering, Anyang Normal University, Anyang, Henan 455002, PR China and School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi 03000 ...;School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, PR China

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

Quantified Score

Hi-index 0.07

Visualization

Abstract

The n-dimensional star graph S"n is one of the most attractive interconnection networks of large scale multiprocessor systems. The k-embedding-restricted (edge) connectivity (@h"k(S"n)) @z"k(S"n) of S"n is defined to be the cardinality of a minimum subset of (edges) nodes, if any, whose deletion disconnects S"n and each node of the remaining components lies in an undamaged k-dimensional substar S"k. In this paper, we investigate the k-embedding-restricted (edge) connectivity of S"n and determine the values of @h"k(S"n) and @z"k(S"n) for some k's.