Computer Science – Discrete Mathematics
Scientific paper
2011-05-05
Computer Science
Discrete Mathematics
10 pages, 2 figures
Scientific paper
The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary n-cube is an important interconnection network of parallel computing systems. The 1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for k > 3 in [Y.-C. Chen, J. J. M. Tan, Restricted connectivity for three families of interconnection networks, Applied Mathematics and Computation 188 (2) (2007)1848--1855]. Nevertheless, the h-extra connectivity of 3-ary n-cubes has not been obtained yet. In this paper we prove that the 1-extra connectivity of a 3-ary n-cube is 4n-3 for n> 1 and the 2-extra connectivity of 3-ary n-cube is 6n-7 for n> 2.
Ren Juanjuan
Wang Xinke
Zhu Qianquan
No associations
LandOfFree
Extra connectivity measures of 3-ary n-cubes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Extra connectivity measures of 3-ary n-cubes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extra connectivity measures of 3-ary n-cubes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-689928