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

研究成果: Article › 同行評審

133 引文斯高帕斯（Scopus）

摘要

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.

原文	English
頁（從 - 到）	223-237
頁數	15
期刊	IEEE Transactions on Parallel and Distributed Systems
卷	10
發行號	3
DOIs	https://doi.org/10.1109/71.755822
出版狀態	Published - 1999

All Science Journal Classification (ASJC) codes

訊號處理
硬體和架構
計算機理論與數學

存取文件

10.1109/71.755822

其它文件與鏈接

引用此

@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 - https://www.scopus.com/pages/publications/0032688457

UR - https://www.scopus.com/pages/publications/0032688457#tab=citedBy

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

摘要

All Science Journal Classification (ASJC) codes

存取文件

其它文件與鏈接

指紋

引用此