Constructing vertex-disjoint paths in (n, k)-star graphs

  • Authors:

  • Tsung-Chi Lin;Dyi-Rong Duh

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Chi Nan University, No. 1, University Road, Puli, Nantou Hsien 54561, Taiwan;Department of Computer Science and Information Engineering, National Chi Nan University, No. 1, University Road, Puli, Nantou Hsien 54561, Taiwan

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

Quantified Score

Hi-index 0.07

Visualization

Abstract

This work describes a novel routing algorithm for constructing a container of width n-1 between a pair of vertices in an (n, k)-star graph with connectivity n-1. Since Lin et al. [T.C. Lin, D.R. Duh, H.C. Cheng, Wide diameter of (n, k)-star networks, in: Proceedings of the International Conference on Computing, Communications and Control Technologies, vol. 5, 2004, pp. 160-165] already calculated the wide diameters in (n, n-1)-star and (n, 1)-star graphs, this study only considers an (n, k)-star with 2=