## Abstract

Suppose that G = (V_{0} U V_{1}, E) is a bipartite graph with two partite sets V_{0} and V_{1} of equal size. Let x and y be two arbitrary distinct vertices and let w be another vertex different from x and y. G is said to be strongly hyper-Hamiltonian-laceable if G - w satisfies the following three properties. P1: There is a (|V_{0}| + |V _{1}| - 2)-length path between x and y, where x and y are in the same partite set and w is In the other partite set; P2: There is a (|V_{0}| + |V_{1}| - 3)-length path between x and y, where z and y are in different partite sets and w is in any partite set; P3: There is a (|V _{0}| + |V_{1}| - 4)-length path between x and y, where x, y, w are in the same partite set. Let F_{e} be the set of faulty edges of an n-dimensional hypercube Q_{n}. In this paper, we show that Q_{n} - F_{e} (the graph obtained by deleting all edges of F_{e} from Q_{n}) remains strongly hyper-Hamiltonian-laceable when |F_{e}| ≤ n - 3.

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

Title of host publication | Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 |

Editors | H.R. Arabnia |

Pages | 1081-1083 |

Number of pages | 3 |

Volume | 3 |

Publication status | Published - 2004 |

Event | Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 - Las Vegas, NV, United States Duration: 2004 Jun 21 → 2004 Jun 24 |

### Other

Other | Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 |
---|---|

Country/Territory | United States |

City | Las Vegas, NV |

Period | 04-06-21 → 04-06-24 |

## All Science Journal Classification (ASJC) codes

- Engineering(all)