Pancyclicity on M?bius Cubes with Edge Faults

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Sun-Yuan Hsieh Articles by Chun-Hua Chen

2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)

Hong Kong, SAR, China

May 10-May 12

ISBN: 0-7695-2135-5

	ASCII Text	x
	Sun-Yuan Hsieh, Chun-Hua Chen, "Pancyclicity on M?bius Cubes with Edge Faults," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 168, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.

	BibTex	x
	@article{ 10.1109/ISPAN.2004.1300476, author = {Sun-Yuan Hsieh and Chun-Hua Chen}, title = {Pancyclicity on M?bius Cubes with Edge Faults}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2004}, issn = {1087-4089}, pages = {168}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300476}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Pancyclicity on M?bius Cubes with Edge Faults SN - 1087-4089 SP EP A1 - Sun-Yuan Hsieh, A1 - Chun-Hua Chen, PY - 2004 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Sun-Yuan Hsieh, National Cheng Kung University, Taiwan

Chun-Hua Chen, National Cheng Kung University, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300476

A graph G = (V, E) is said to be pancyclic if it contains cycles of all lengths from 4 to |4| in G. Let F{e} be the set of faulty edges. In this paper, we show that an n-dimensional M?bius cube, n ≥ 1, contains a fault-free Hamiltonian path when |F{e}| ≤ n -1. We also show that an n-dimensional M?bius cube, n ≥ 2, is pancyclic when |F{e}| ≤ n - 2. Since an n-dimensional M?bius cube is regular of degree n, both results are optimal in the worst case.

Citation:

Sun-Yuan Hsieh, Chun-Hua Chen, "Pancyclicity on M?bius Cubes with Edge Faults," ispan, pp.168, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.