共查询到18条相似文献,搜索用时 62 毫秒
1.
2.
3.
本文研究了含故障点的加强超立方体圈嵌入的问题.利用构造的方法,获得了在至多具有n-2个故障点的n-维加强超立方体网络中每条非故障边均在长度从4到2n-2f的圈上,推广了超立方体网络中点容错圈嵌入的结果. 相似文献
4.
研究了在含有故障点和(或)故障边的n维超立方体Qn中经过给定路的无故障圈问题,得到以下结果:设Fv V(Qn),Fe E(Qn).若|Fv|+|Fe|≤n-h且3≤h≤n,或|Fv|+|Fe|≤n-3且h=2,则在Qn-Fv-Fe中,每一条长度等于h的路P都包含在每个偶长度从2h+2到2^n-2|Fv|的圈中.并且若又有条件|Fv|+|Fe|〈h-1时,则路P还包含在长度等于2h的无故障的圈中. 相似文献
5.
n维超立方体在并行计算领域有着广泛的应用,其特殊的拓扑结构对大规模的多处理器系统的性能具有重要的影响.在选择互连网络时,汉密尔顿性是评估网络性能的一个重要指标.本文研究n维超立方体Q_n中的汉密尔顿圈,采用构造的方法证明了以下结论:当n是2的幂次方时,Q_(2n)中有且仅有n个边不交的汉密尔顿圈. 相似文献
7.
(d,k)控制数是刻画容错网络中资源共亨可靠性的一个新参数.本文考虑了k维超立方体Qk的(d,k)控制数,得到:γ1,k(Qk)=2k-1(k>1);d=[k/2] 1(k>2)时,γd,k(Qk)=2;d≤[k/2](k≥4)时,3≤γd,k(Qk)≤2k-d 1;以及若d为正整数,且[k/d]=[k/(d-1)] 1,则γd,k(Qk)=γd,k(Qk),其中[k/d].d 1≤k1≤k. 相似文献
9.
超立方体网络是目前在超级计算机处理器结构中应用得最广泛的拓扑结构,M(o)bius立方体是超立方体的一种变形,已经被证明它在某些方面具有优于超立方体的拓扑性质.本文指出了n维M(o)bius立方体递归结构的一些重要拓扑性质. 相似文献
10.
超立方体网络是目前在超级计算机处理器结构中应用得最广泛的拓扑结构,M(o)bius立方体是超立方体的一种变形,已经被证明它在某些方面具有优于超立方体的拓扑性质.本文指出了n维M(o)bius立方体递归结构的一些重要拓扑性质. 相似文献
11.
Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4. 相似文献
12.
In this paper, we study the enhanced hypercube, an attractive variant of the hypercube and obtained by adding some complementary edges from a hypercube, and focus on cycles embedding on the enhanced hypercube with faulty vertices. Let Fu be the set of faulty vertices in the n-dimensional enhanced hypercube Qn,k (n ≥ 3, 1 ≤ k 〈≤n - 1). When IFvl = 2, we showed that Qn,k - Fv contains a fault-free cycle of every even length from 4 to 2n - 4 where n (n ≥ 3) and k have the same parity; and contains a fault-free cycle of every even length from 4 to 2n - 4, simultaneously, contains a cycle of every odd length from n-k + 2 to 2^n-3 where n (≥ 3) and k have the different parity. Furthermore, when |Fv| = fv ≤ n - 2, we prove that there exists the longest fault-free cycle, which is of even length 2^n - 2fv whether n (n ≥ 3) and k have the same parity or not; and there exists the longest fault-free cycle, which is of odd length 2^n - 2fv + 1 in Qn,k - Fv where n (≥ 3) and k have the different parity. 相似文献
13.
14.
Let FF_v be the set of faulty nodes in an n-dimensional folded hypercube FQ_n with |FF_v| ≤ n-1 and all faulty vertices are not adjacent to the same vertex. In this paper, we show that if n ≥ 4, then every edge of FQn-FF_v lies on a fault-free cycle of every even length from 6 to 2~n-2|FF_v|. 相似文献
15.
本文证明了:若对二部竞赛图T的每一顶点v,总有min{dT^+(v),dT^-(v)}≥k≥3,则T中存在长度至少为4r的AD路或AD回路,除非T同构于一类例外图之一。作为推论,我们得到:正则二部竞赛图T含有ADH回路,除非T属于一类例外图。 相似文献
16.
《Quaestiones Mathematicae》2013,36(2):123-139
AbstractA set B of vertices of a graph G = (V,E) is a k-maximal independent set (kMIS) if B is independent but the deletion of any l-subset X from B (where l ≤ k—1) followed by the addition of any l + 1 vertices from V—B, produces a dependent set. We calculate the smallest cardinality of a kMIS for paths and cycles, and obtain Nordhaus-Gaddum type results for these parameters for graphs in general. 相似文献
17.
1引言设G=(V,E)为无向图.子集D (?)V(G)是无向图G的控制集,如果对于任意的y,∈V(G)-D,都存在x∈D,使xy∈E(G).G的控制集D是G的分裂控制集,如果G中由V(G)-D导出的子图G〈V(G)-D〉是不连通的.G的一个控制集D是G的一个强(弱)控制集,若dG(x)≥d_G(y)(d_G(x)≤d_G(y)),其中d_G(x)表示G中与点x关联的边数.对于有向图H=(V,A),子集D(?)V(H)称为H的控制集,如果对于任意的y∈ 相似文献
18.
讨论平面上OLG模型的均衡解的稳定性,并利用一个类似稳定流形定理的结论,把二维动力系统化为一维动力系统,从而在整体上研究带有国家财政赤字的OLG模型. 相似文献