Abstract
Connectivity is an important measurement for the fault tolerance in interconnection networks. It is known that the augmented cube AQ n is maximally connected, i.e. (2n - 1)-connected, for n ≥ 4. By the classical Menger’s Theorem, every pair of vertices in AQ n 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 some research works on networks with faults, we have a further result that for any faulty vertex set F ⊂ V(AQ n ) and |F| ≤ 2n − 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 have another result that for any faulty vertex set F ⊂ V(AQ n ) and |F| ≤ 4n − 9 for n ≥ 4, there exists a large connected component with at least 2n − |F| − 1 vertices in AQ n − F. In general, a remaining large fault-free connected component also increases fault tolerance.
This work was supported in part by the National Science Council of the Republic of China under Contract NSC 96-2221-E-009-137-MY3. This research was partially supported by the Aiming for the Top University and Elite Research Center Development Plan.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barefoot, C.A., Entringer, R., Swart, H.: Vulnerability in graphs - a comparative survey. Journal of Combinatorial Mathematics and Combinatorial Computing 1, 12–22 (1987)
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. North Holland, New York (1980)
Chen, Y.C., Tan, J.J.M., Hsu, L.H.: Super-connectivity and super-edge-connectivity for some interconnection networks. Applied Mathematics and Computation 140, 245–254 (2003)
Choudum, S.A., Sunitha, V.: Augmented cubes. Networks 40(2), 71–84 (2002)
Day, K., Tripathi, A.: A comparative study of topologies properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems 5, 31–38 (1994)
Ma, M., Liu, G., Xu, J.M.: Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. Parallel Computing 33, 36–42 (2007)
Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10, 96–115 (1927)
Oh, E., Chen, J.: On strong Menger-connectivity of star graphs. Discrete Applied Mathematics 129, 499–511 (2003)
Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Transactions on Computers 37, 867–872 (1988)
Shih, L.M., Chiang, C.F., Hsu, L.H., Tan, J.J.M.: Strong Menger connectivity with conditional faults on the class of hypercube-like networks. Information Processing Letters 106, 64–69 (2008)
Yang, X., Evans, D.J., Chen, B., Megson, G.M., Lai, H.: On the maximal connected component of hpercube with faulty vertices. International Journal of Computer Mathematics 81, 515–525 (2004)
Yang, X., Evans, D.J., Megson, G.M.: On the maximal connected component of hpercube with faulty vertices II. International Journal of Computer Mathematics 81, 1175–1185 (2004)
Yang, X., Evans, D.J., Megson, G.M.: On the maximal connected component of hpercube with faulty vertices III. International of Journal Computer Mathematics 83, 27–37 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, YC., Chen, MH., Tan, J.J.M. (2009). Maximally Local Connectivity on Augmented Cubes. In: Hua, A., Chang, SL. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2009. Lecture Notes in Computer Science, vol 5574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03095-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-03095-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03094-9
Online ISBN: 978-3-642-03095-6
eBook Packages: Computer ScienceComputer Science (R0)