The globally bi-3* and hyper bi-3* connectedness of the spider web networks
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Yu-Chee Tseng. Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes , 1996, Inf. Process. Lett..
[3] Lih-Hsing Hsu,et al. Optimal 1-Hamiltonian Graphs , 1998, Inf. Process. Lett..
[4] K. Menger. Zur allgemeinen Kurventheorie , 1927 .
[5] Lih-Hsing Hsu,et al. On the construction of combined k-fault-tolerant Hamiltonian graphs , 2001, Networks.
[6] Lih-Hsing Hsu,et al. Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs , 2005, Appl. Math. Comput..
[7] Lih-Hsing Hsu,et al. Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings , 1999, Inf. Process. Lett..
[8] Ivan Stojmenovic,et al. Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..
[9] Lih-Hsing Hsu,et al. Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs , 2003, Inf. Process. Lett..
[10] Cheng-Kuan Lin,et al. The super connectivity of the pancake graphs and the super laceability of the star graphs , 2005, Theor. Comput. Sci..
[11] Lih-Hsing Hsu,et al. Hamiltonian Laceability of Spider Web Networks , 2005 .