The spanning diameter of the star graphs
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[3] Abdelmadjid Bouabdallah,et al. Embedding Complete Binary Trees into Star and Pancake Graphs , 1998, Theory of Computing Systems.
[4] D.Frank Hsu,et al. On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .
[5] Luisa Gargano,et al. Fault Tolerant Routing in the Star and Pancake Interconnection Networks , 1993, Inf. Process. Lett..
[6] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[7] Jimmy J. M. Tan,et al. Hamiltonian laceability on edge fault star graph , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..
[8] Selim G. Akl,et al. Decomposing a Star Graph Into Disjoint Cycles , 1991, Inf. Process. Lett..
[9] Gen-Huey Chen,et al. Hamiltonian-laceability of star graphs , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).
[10] Khaled Day,et al. A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..
[11] Pradip K. Srimani,et al. Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..
[12] K. Menger. Zur allgemeinen Kurventheorie , 1927 .
[13] Cheng-Kuan Lin,et al. The super connectivity of the pancake graphs and the super laceability of the star graphs , 2005, Theor. Comput. Sci..
[14] Jimmy J. M. Tan,et al. Hyper hamiltonian laceability on edge fault star graph , 2004, Inf. Sci..