【摘要】：G是一個(gè)圖,h是一個(gè)正整數(shù),一個(gè)圖G的h-限制性連通度(h-限制性邊連通度)是使得G刪除G中的某個(gè)點(diǎn)集(邊集)使得G不連通且每個(gè)分支中點(diǎn)的度數(shù)至少是h的最小點(diǎn)集(邊集)的基數(shù).特殊地,1-限制性連通度(1-限制性邊連通度)又稱為超連通度(超邊連通度).h-限制性連通度參數(shù)是傳統(tǒng)連通度參數(shù)的一個(gè)廣義化,并且它提高了連通度測量的準(zhǔn)確性.研究表明如果互聯(lián)網(wǎng)絡(luò)有限制性連通度的特性則它是更可靠的并且比其它網(wǎng)絡(luò)有一個(gè)更低的點(diǎn)的容錯(cuò)率.n維超立方體Q_n在平行計(jì)算系統(tǒng)當(dāng)中是最流行的網(wǎng)絡(luò)之一.n維交叉立方體CQ_n是Q_n的一個(gè)變形.張?jiān)谖恼耓Folded-crossed hypercube:a complete interconnection network,J.Syst.Archit.47(2002)917-922]中介紹了一個(gè)由交叉立方CQ_n增加2n-1條邊后得到新的一個(gè)網(wǎng)絡(luò)n維折疊交叉立方體FCQ_n.本文第一部分,我們證明了n維折疊交叉立方體FCQ_n的超連通度和超邊連通度都是2n,n≥4.第二部分證明了n維交叉立方體CQ_n的2-和3-限制性連通度分別是4n-8,n≥4和8n-24,n≥5.
[Abstract]:G is a graph, h is a positive integer, The h-restricted connectivity (h-restricted edge connectivity) of a graph G is such that G deletes a set of points (edge sets) in G such that G is disconnected and the degree of the midpoint of each branch is at least the cardinality of the minimum set of points (edge sets) of h. In particular, 1-restricted connectivity (1-restricted edge connectivity) is also called hyperconnectivity (super-edge connectivity). And it improves the accuracy of connectivity measurement. The study shows that if the Internet has restrictive connectivity, it is more reliable and has a lower fault-tolerant rate than other networks. N-dimensional hypercube Qn is the most popular network in parallel computing systems. N-dimensional cross cube CQ_n is a deformation of QS-n. In his paper [Folded-crossed hypercube:a complete interconnection network,J.Syst.Archit.47 (2002) 917-922], Zhang introduced a new network of n-dimensional folded crossed cube FCQ_n., which was obtained by adding 2n-1 edges to the cross cubic CQ_n. In the first part of this paper, we prove that the hyperconnectivity and hyper-edge connectivity of n-dimensional folded crossed cube FCQ_n are both 2nn 鈮，

本文編號：2419937