| Popis: |
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 n is maximally connected, i.e. ( 2 n - 1 ) -connected, for n ⩾ 4 . By the classic Menger’s Theorem, every pair of vertices in AQ n is connected by 2 n - 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 ⊂ V ( AQ n ) and | F | ⩽ 2 n - 7 for n ⩾ 4 , each pair of non-faulty vertices, denoted by u and v, in AQ n - F is connected by min { deg f ( u ) , deg f ( v ) } vertex-disjoint fault-free paths, where deg f ( u ) and deg f ( v ) are the degree of u and v in AQ n - F , respectively. Moreover, we demonstrate that for any faulty vertex set F ⊂ V ( AQ n ) and | F | ⩽ 4 n - 9 for n ⩾ 4 , there exists a large connected component with at least 2 n - | F | - 1 vertices in AQ n - F , which improves on the results of Ma et al. (2008) who show this for n ⩾ 6 . |
Full Text from ScienceDirect