Maximally local connectivity and connected components of augmented cubes

檔案

日期

2014-07-20

類型

期刊名稱

INFORMATION SCIENCES

卷期與頁次

第 273 卷,頁 387–392

ISSN

0020-0255

語言

英文

摘要

The connectivity of a graph is an important issue in graph theory, and is also one of the most important factors in evaluating the reliability and fault tolerance of a network. It is known that the augmented cube AQ is maximally connected, i.e. (2n - 1)-connected, for n >= 4. By the classic Menger\'s Theorem, every pair of vertices in AQ is connected by 2n - 1 vertex-disjoint paths for n >= 4. A routing with parallel paths can speed up transfers of large amounts of data and increase fault tolerance. Motivated by research on networks with faults, we obtained the result that for any faulty vertex set F c V(AQ) and [F] < 2n - 7 for n >= 4, each pair of non-faulty vertices, denoted by u and v, in AQ F is connected by min{deg(f)(u), deg(f) (v)} vertex-disjoint fault-free paths, where degf(u) and degf(v) are the degree of u and v in AQ(n) - F, respectively. Moreover, we demonstrate that for any faulty vertex set F subset of V(AQ(n)) and vertical bar F vertical bar < 4n - 9 for n 4, there exists a large connected component with at least 2(n) - vertical bar F vertical bar 1 vertices in AQ F, which improves on the results of Ma et al. (2008) who show this for n >= 6. (C) 2014 Elsevier Inc. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, Y.-C., Chen, M.-H., & Tan, J. J. M. (2014). Maximally local connectivity and connected components of augmented cubes. INFORMATION SCIENCES, 273, 387–392. https://doi.org/10.1016/j.ins.2014.03.022

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/24387