Pancyclicity on Mobius cubes with edge faults

Author

Hsieh, Sun-Yuan ; Chen, Chun-Hua

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

fYear

2004

fDate

10-12 May 2004

Firstpage

168

Lastpage

173

Abstract

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

Keywords

graph theory; multiprocessor interconnection networks; Mobius cubes; edge faults; fault-free Hamiltonian path; faulty edges; interconnection network topology; pancyclic graph; pancyclicity; Computer networks; Computer science; Data flow computing; Distributed computing; Hypercubes; Length measurement; Local area networks; Multiprocessor interconnection networks; Network topology; Token networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

ISSN

1087-4089

Print_ISBN

0-7695-2135-5

Type

conf

DOI

10.1109/ISPAN.2004.1300476

Filename

1300476

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3013148