# Cycle Embedding on the M ¨ obius Cube with Both Faulty Nodes and Faulty Edges

```@article{Hsieh2005CycleEO,
title={Cycle Embedding on the M ¨ obius Cube with Both Faulty Nodes and Faulty Edges},
author={Sun-Yuan Hsieh and Nai-Wen Chang},
journal={11th International Conference on Parallel and Distributed Systems (ICPADS'05)},
year={2005},
volume={2},
pages={620-624}
}```
A graph G = (V,E) is said to be pancyclic if it contains fault-free cycles of all lengths from 4 to |V | in G. Let Fv and Fe be the sets of faulty nodes and faulty edges of an n-dimensional M¨obius cube MQn, respectively, and let F = Fv U Fe. In this paper, we show that MQn - F contains a fault-free Hamiltonian path when |F| \le n - 1 and n \ge 1. We also show that MQn - F is pancyclic when |F| \le n - 2 and n \ge 2. Since MQn is regular of degree n, both results are optimal in the worst case.

2 Citations
10 References
Similar Papers

#### Citations

##### Publications citing this paper.
Showing 1-2 of 2 extracted citations
Highly Influenced
4 Excerpts

#### References

##### Publications referenced by this paper.
Showing 1-10 of 10 references

## L

• W. Huang, Y. Chuang, J.J.M. Tan
• Hsu, “Fault-free Hamiltonian cycles in faulty M…
• 2000
Highly Influential
5 Excerpts
7 Excerpts
3 Excerpts

## Diagnosability of th Möbius Cubes,

• Jianxi Fan
• IEEE Transactions on Parallel and Distributed…
• 1998
1 Excerpt

## Interconnection Networks and Algorithms,

• D. F. Hsu
• a special issue of Networks,
• 1993
1 Excerpt
1 Excerpt

## The Möbius cubes , ” in Proceedings of the sixth Distrib

• S. M. Larson
• Memory Computing Conference
• 1991

## and S

• P. Cull
• M. Larson, “The Möbius cubes,” in Proceedings of…
• 1991
2 Excerpts