The study of adjacent vertices fault-tolerance bifanability of hypercube with the same color sources
晏慶展、洪春男
E-mail: [email protected]
ABSTRACT
We investigate adjacent vertices fault-tolerance bifanability of hypercube with the same color sources. Let Q_n = (V_b ∪ V_w，E) be the n-dimensional hypercube. Let F_a be the set of fa pairs of adjacently faulty vertices. Let
s_1,t^2_1,...,t^{k_1}_1,s_2,t^2_2,....,t^{k_2}_2?kV_i,t^1_1,t^1_2?kV_j be arbitrary fault-free vertices of Q_n for {i， j} = {b，w}.
In this paper， we construct the spanning internally disjoint paths P(s_1,t^i_1) and P(s_1,t^j_1) of Q_n ? F_a for f_a ? n ? 3, f_a + k_1 + k_2 = n ? 1, 1 ? i ? k_1,1 ? j ? k_2.
Keywords : hypercube、bifanability、adjacently faulty vertices、fault-tolerance Table of Contents
封面內頁 簽名頁 授權書...iii 英文摘要...iv 中文摘要...v 誌謝...vi 目錄...vii 圖目錄...viii Chapter 1 Introduction...1 Chapter 2 Main result...3 2.1 Preliminarie...3 2.2 The adjacent vertices fault-tolerance of bifanabilit...9 Chapter 3
Conclusion...31 Reference...32 REFERENCES
[1] Rostislav Caha and V. Koubek, Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets, " J. Graph Theory, 51 (2005), pp.137- 169.
[2] Rostislav Caha and Vclav Koubek, Spanning multi-paths in hypercubes," Dis- crete Mathematics, 307 (2007), pp.2053-2066.
[3] Yi-Hua Chang and Chun-Nan Hung, Adjacent Vertices Fault-tolerance Hamil- tonian Laceability of Hypercube," Workshop on Combinatorial Mathematics and Computational Theory, (2005), pp.301-309.
[4] Chung-Haw Chang and Cheng-Kuan Lin, Hua-Min Huang, and Lih-Hsing Hsu, The super laceability of the hypercubes," Information Processing Letters, 92 (2004), pp.15-21.
[5] Y-Chuang Chen and Chang-Hsiung Tsai, Lih-Hsing Hsu, Jimmy J.M. Tan, On some super fault-tolerant Hamiltonian graphs," Applied Mathematics and Com- putation, 148 (2004), pp.729-741.
[6] Xie-Bin Chen, Hamiltonian paths and cycles passing through a prescribed path in hypercubes," Information Processing Letters, 110 (2009), pp.77-82.
[7] Xie-Bin Chen, Many-to-many disjoint paths in faulty hypercubes," Information Sciences, 179 (2009), pp.3110-3115.
[8] Chia-Cheng Chen and Chun-Nan Hung and Ko-Chen Hu, Edge Fault-tolerant of k*-bifanability for bipartite Hypercube-like graphs,"
Workshop on Combinatorial Mathematics and Computational Theory, (2005), pp.134-139.
[9] Tomas Dvorak and Petr Gregor, Hamiltonian fault-tolerance of hypercubes," Electronic Notes in Discrete Mathematics, 29 (2007), pp.471-477.
[10] Tomas Dvorak and Petr Gregor, Hamiltonian paths with prescribed edges in hypercubes," Discrete Mathematics, 307 (2007), pp.1982-1998.
[11] Jung-Sheng Fu, Fault-tolerant cycle embedding in the hypercube," Parallel Computing, 29 (2003), pp.821-832.
[12] Ko-Chen Hu and Chun-Nan Hung and Chia-Cheng Chen, Edge Fault-tolerant Hamiltonian Laceability of Bipartite Hypercube-like Networks," Proceedings of the 22nd Workshop on Combinatorial Mathematics and Computational Theory, (2005), pp.129-133.
[13] Ko-Chen Huand and Chun-Nan Hung and Chia-Cheng Chen, Edges fault- tolerant Hamiltonian laceability of bipartite hypercube-like networks," Workshop on Combinatorial Mathematics and Computational Theory, (2005), pp.129-133.
[14] Chun-Nan Hung and P. Lin, The Study for Adjacent Vertices Fault-Tolerance Bifanability of Hypercube," Proceedings of the 2009 National Computer Sympo- sium Workshop on Algorithms and Bioinformatics, (2009), pp.215-224.
[15] Chun-Nan Hung and Guan-Yu Shi, Vertex fault tolerance for multiple span- ning paths in hypercube," Proceedings of the 24th Workshop on Combinatorial Mathematics and Computational Theory, (2007), pp.241-250.
[16] Chun-Nan Hung and K.C. Hu, Fault-tolerant Hamiltonian laceability of bipar- tite hypercube-like networks," The Proceedings of the 2004 International Com- puter Symposium, (2004), pp.1145-1149.
[17] Di Liu and Jing Li, Many-to-many n-disjoint path covers in n-dimensional hy- percubes," Information Processing Letters, 110 (2010),
pp.580-584.
[18] Chong-Dae Park and K.Y. Chwa, Hamiltonian properties on the class of hypercube-like network," Information Processing Letters, 91 (2004), pp.11-17.
[19] Wen-Yan Su and Chun-Nan Hung, The longest ring embedding in faulty hy- percube," Workshop on Combinatorial Mathematics and Computational Theory, (2006), pp.262-272.
[20] Chang-Hsiung Tsai and Jimmy J.M. Tan and Tyne Liang and Lih-Hsing Hsu, "Fault-tolerant Hamiltonian laceability of hypercubes,"
Information Processing Letters, 83(2002), pp.301-306.
[21] Aniruddha S. Vaidya, A Class of Hypercube-like Networks," Parallel and Dis- tributed Processing, 1993. Proceedings of the Fifth IEEE Symposium, (1993), pp.800-803.
