2-disjoint path covers in k-ary 3-cubes with fault edges

doi:10.3778/j.issn.1002-8331.1604-0435

Computer Engineering and Applications ›› 2017, Vol. 53 ›› Issue (2): 72-78.DOI: 10.3778/j.issn.1002-8331.1604-0435

Previous Articles Next Articles

2-disjoint path covers in k-ary 3-cubes with fault edges

GUAN Wenhui, LI Jing, GAO Xiaohui

School of Applied Science, Taiyuan University of Science and Technology, Taiyuan 030024, China

Online:2017-01-15 Published:2017-05-11

边故障K元3立方体的二不交路覆盖

管文慧，李晶，高晓慧

太原科技大学应用科学学院，太原 030024

Abstract

Abstract: The paper studies the problem of 2-disjoint paths cover of k-ary 3-cube. Let [F] be any subset of edges with [|F|] no more than 3. In this paper, the following result is obtained. For arbitrarily two original points and two sink points in [Qk3], there exist two fault-free vertex-disjoint paths [P1] and [P2] between a original point and a sink point separately, such that cover of [Qk3].

Key words: interconnection network, k-ary 3-cube, disjoint paths cover

摘要： 研究具有故障边的[k]元3立方体的非指定二不交路覆盖问题。证明了在具有至多3条故障边的[k]元3立方体[Qk3]中，任意给定两个源点和两个汇点，则存在两条顶点不交的路[P1]和[P2]，分别连接一个源点和汇点，且[V(P1)?V(P2)=V(Qk3)]。

关键词: 互连网络, [k]元3立方体, 不交路覆盖

GUAN Wenhui, LI Jing, GAO Xiaohui. 2-disjoint path covers in k-ary 3-cubes with fault edges[J]. Computer Engineering and Applications, 2017, 53(2): 72-78.

管文慧，李晶，高晓慧. 边故障K元3立方体的二不交路覆盖[J]. 计算机工程与应用, 2017, 53(2): 72-78.

[1]	FENG Kai, LI Jing. Subnetwork Reliability of k-Ary n-Cube Networks [J]. Computer Engineering and Applications, 2021, 57(16): 83-89.
[2]	ZHANG Guozhen. Sufficient conditions for networks to be maximally restricted edge-connected [J]. Computer Engineering and Applications, 2017, 53(8): 19-22.
[3]	ZHANG Guozhen. Unidirectional [k]-ary [n]-cube networks [J]. Computer Engineering and Applications, 2015, 51(20): 1-4.
[4]	ZHANG Shurong, WANG Shiying, DONG Cao. Hyper hamiltonian laceability of k-ary n-cubes with edge faults [J]. Computer Engineering and Applications, 2014, 50(21): 39-43.
[5]	WEI Baoya1, LIU Rihua2, CHEN Baoxing1. Diameter formula and optimal routing algorithm for double-loops Petersen networks [J]. Computer Engineering and Applications, 2013, 49(5): 81-83.
[6]	ZHANG Guozhen. Reliability of [k-ary] [n-cube] networks [J]. Computer Engineering and Applications, 2013, 49(22): 3-6.
[7]	LIU Bin1, LI Zhijun1, ZENG Yicheng2, YANG Jun1, ZHANG Jiao1. FPAA based on digitally controlled linearly tunable OTA [J]. Computer Engineering and Applications, 2013, 49(19): 49-53.
[8]	ZHAO Yuanqing1, JIN Xianhua2. 3-restricted edge connectivity of star graph networks [J]. Computer Engineering and Applications, 2012, 48(7): 81-83.
[9]	ZHAO Yuanqing1, JIN Xianhua2. The 4-restricted edge connectivity of star networks [J]. Computer Engineering and Applications, 2012, 48(13): 71-74.
[10]	HUA Renjie，LIANG Jiarong，WENG Yi. Study on fault-tolerance seeking paths strategy with adaptivity in star networks [J]. Computer Engineering and Applications, 2011, 47(4): 105-108.
[11]	YANG Yuxing1，3，WANG Shiying2. Conditional vertex connectivity measures for bubble-sort networks [J]. Computer Engineering and Applications, 2011, 47(22): 13-16.
[12]	YAN Shaohua，FAN Jianxi. Diagnosability of Cross-cube under PMC diagnostic model [J]. Computer Engineering and Applications, 2011, 47(17): 83-86.
[13]	DU Yan，LIU Fang-ai，XING Chang-ming. Hierarchical network HDRN and its routing algorithms [J]. Computer Engineering and Applications, 2010, 46(34): 74-76.
[14]	XIA Lei¹,LIU Fang-ai². Embeddings of double-loop network into RP（k） [J]. Computer Engineering and Applications, 2007, 43(29): 129-131.
[15]	QU Ying-jie. Design and analysis of interconnection network of reconfigurable cryptographic processor [J]. Computer Engineering and Applications, 2007, 43(23): 167-170.

2-disjoint path covers in k-ary 3-cubes with fault edges

边故障K元3立方体的二不交路覆盖

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics