Discrete Mathematics & Theoretical Computer Science |

466

In this paper, we study long cycles in induced subgraphs of hypercubes obtained by removing a given set of faulty vertices such that every two faults are distant. First, we show that every induced subgraph of Q(n) with minimum degree n - 1 contains a cycle of length at least 2(n) - 2(f) where f is the number of removed vertices. This length is the best possible when all removed vertices are from the same bipartite class of Q(n). Next, we prove that every induced subgraph of Q(n) obtained by removing vertices of some given set M of edges of Q(n) contains a Hamiltonian cycle if every two edges of M are at distance at least 3. The last result shows that the shell of every linear code with odd minimum distance at least 3 contains a Hamiltonian cycle. In all these results we obtain significantly more tolerable faulty vertices than in the previously known results. We also conjecture that every induced subgraph of Q(n) obtained by removing a balanced set of vertices with minimum distance at least 3 contains a Hamiltonian cycle.

Source : oai:HAL:hal-00988176v1

Volume: Vol. 11 no. 1

Section: Graph and Algorithms

Published on: January 1, 2009

Imported on: March 26, 2015

Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 179 times.

This article's PDF has been downloaded 170 times.