Cycle embedding in alternating group graphs with faulty elements

Ping Ying Tsai*, Yu Tzu Lin

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

2 引文 斯高帕斯(Scopus)

摘要

The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. Cycle embedding is an important issue in evaluating the efficiency of interconnection networks. In this paper, we show that an n-dimensional alternating group graph AGn has the following results, where F is the set of faulty vertices and/or faulty edges in AGn : (1) For n ≥ 4, AGn-F is edge 4-pancyclic if |F| ≤ n − 4; and (2) For n ≥ 3, AGn-F is vertex-pancyclic if |F| ≤ n − 3. All the results are optimal with respect to the number of faulty elements tolerated, and they are improvements over the cycle embedding properties of alternating group graphs proposed previously in several articles.

原文英語
主出版物標題Advanced Technologies, Embedded and Multimedia for Human-Centric Computing, HumanCom and EMC 2013
發行者Springer Verlag
頁數1
ISBN(列印)9789400772618
DOIs
出版狀態已發佈 - 2014 一月 1
事件Advanced Technologies, Embedded and Multimedia for Human-Centric Computing, HumanCom and EMC 2013 - , 臺灣
持續時間: 2013 八月 232013 八月 25

出版系列

名字Lecture Notes in Electrical Engineering
260
ISSN(列印)1876-1100
ISSN(電子)1876-1119

會議

會議Advanced Technologies, Embedded and Multimedia for Human-Centric Computing, HumanCom and EMC 2013
國家/地區臺灣
期間2013/08/232013/08/25

ASJC Scopus subject areas

  • 工業與製造工程

指紋

深入研究「Cycle embedding in alternating group graphs with faulty elements」主題。共同形成了獨特的指紋。

引用此