On the spanning connectivity and spanning laceability of hypercube-like networks

  • Authors:

  • Cheng-Kuan Lin;Jimmy J. M. Tan;D. Frank Hsu;Lih-Hsing Hsu

  • Affiliations:

  • Department of Computer Science, National Chiao Tung University, Hsinchu, 30010, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, 30010, Taiwan, ROC;Department of Computer and Information Science, Fordham University, New York, NY 10023, USA;Department of Computer Science and Information Engineering, Providence University, Taichung, 43301, Taiwan, ROC

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2007

Quantified Score

Hi-index 5.23

Visualization

Abstract

Let u and v be any two distinct nodes of an undirected graph G, which is k-connected. For 1@?w@?k, a w-containerC(u,v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u,v) of G is a w^*-container if it contains all the nodes of G. A graph G is w^*-connected if there exists a w^*-container between any two distinct nodes. A bipartite graph G is w^*-laceable if there exists a w^*-container between any two nodes from different parts of G. Let G"0=(V"0,E"0) and G"1=(V"1,E"1) be two disjoint graphs with |V"0|=|V"1|. Let E={(v,@f(v))|v@?V"0,@f(v)@?V"1, and @f:V"0-V"1 is a bijection}. Let G=G"0@?G"1=(V"0@?V"1,E"0@?E"1@?E). The set of n-dimensional hypercube-like graph H"n^' is defined recursively as (a) H"1^'={K"2}, K"2= complete graph with two nodes, and (b) if G"0 and G"1 are in H"n^', then G=G"0@?G"1 is in H"n"+"1^'. Let B"n^'={G@?H"n^' and G is bipartite} and N"n^'=H"n^'@?B"n^'. In this paper, we show that every graph in B"n^' is w^*-laceable for every w, 1@?w@?n. It is shown that a constructed N"n^'-graph H can not be 4^*-connected. In addition, we show that every graph in N"n^' is w^*-connected for every w, 1@?w@?3.