### Abstract

A graph is denoted by G with the vertex set V(G) and the edge set E(G). A path P = < v(0), v(1),..., v(m)> is a sequence of adjacent vertices. Two paths with equal length P-1 = < u(1), u(2),..., u(m)> and P-2 = < v(1), v(2),..., v(m)> from a to b are independent if u(1) = v(1) = a, u(m) = v(m) = b, and u(i) not equal v(i) for 2 <= i 6 <= m - 1. Paths with equal length {P-i}(i-1)(n) from a to b are mutually independent if they are pairwisely independent. Let u and v be two distinct vertices of a bipartite graph G, and let l be a positive integer length, d(G)(u, v) <= l <= vertical bar V(G) - 1 vertical bar with (l - d(G)(u, v)) being even. We say that the pair of vertices u, v is ( m, l)- mutually independent bipanconnected if there exist m mutually independent paths {P-i(l)}(i-1)(m) with length l from u to v. In this paper, we explore yet another strong property of the hypercubes. We prove that every pair of vertices u and v in the n-dimensional hypercube, with d(Qn) (u, v) >= n - 1, is (n - 1,l)-mutually independent bipanconnected for every l; d(Qn) (u, v) <= l <= vertical bar V(Q(n))-1 vertical bar with (l - d(Qn) (u, v)) being even. As for d(Qn) (u, v) <= n - 2, it is also (n - 1,l)-mutually independent bipanconnected if l >= d(Qn) (u, v) + 2, and and is only (l,l)-mutually independent bipanconnected if l = d(Qn)(u, v). (C) 2010 Elsevier Inc. All rights reserved.

Original language | English |
---|---|

Title of host publication | 10th International Symposium on Pervasive Systems, Algorithms, and Networks |

Publisher | IEEE |

Pages | 4017-4023 |

Number of pages | 7 |

ISBN (Electronic) | 978-1-4244-5404-4 |

ISBN (Print) | 978-1-4244-5403-7 |

DOIs | |

State | Published - 15 Dec 2010 |

### Keywords

- BIPANCYCLICITY

## Fingerprint Dive into the research topics of 'Mutually independent bipanconnected property of hypercube'. Together they form a unique fingerprint.

## Cite this

Shih, Y-K., Tan, J-M., & Hsu, L. H. (2010). Mutually independent bipanconnected property of hypercube. In

*10th International Symposium on Pervasive Systems, Algorithms, and Networks*(pp. 4017-4023). IEEE. https://doi.org/10.1109/I-SPAN.2009.88