Fault-free Hamiltonian cycles in faulty arrangement graphs

Sun Yuan Hsieh; Gen Huey Chen; Chin Wen Ho

doi:10.1109/71.755822

Fault-free Hamiltonian cycles in faulty arrangement graphs

Sun Yuan Hsieh, Gen Huey Chen, Chin Wen Ho

Research output: Contribution to journal › Article › peer-review

132 Citations (Scopus)

Abstract

The arrangement graph A _n,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.

Original language	English
Pages (from-to)	223-237
Number of pages	15
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	10
Issue number	3
DOIs	https://doi.org/10.1109/71.755822
Publication status	Published - 1999

All Science Journal Classification (ASJC) codes

Signal Processing
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/71.755822

Cite this

@article{826d0f290de445e3adde98283c734e52,

title = "Fault-free Hamiltonian cycles in faulty arrangement graphs",

abstract = "The arrangement graph A n,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.",

author = "Hsieh, {Sun Yuan} and Chen, {Gen Huey} and Ho, {Chin Wen}",

year = "1999",

doi = "10.1109/71.755822",

language = "English",

volume = "10",

pages = "223--237",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "3",

}

TY - JOUR

T1 - Fault-free Hamiltonian cycles in faulty arrangement graphs

AU - Hsieh, Sun Yuan

AU - Chen, Gen Huey

AU - Ho, Chin Wen

PY - 1999

Y1 - 1999

N2 - The arrangement graph A n,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.

AB - The arrangement graph A n,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.

UR - http://www.scopus.com/inward/record.url?scp=0032688457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032688457&partnerID=8YFLogxK

U2 - 10.1109/71.755822

DO - 10.1109/71.755822

M3 - Article

AN - SCOPUS:0032688457

SN - 1045-9219

VL - 10

SP - 223

EP - 237

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 3

ER -

Fault-free Hamiltonian cycles in faulty arrangement graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this