Domination numbers of undirected toroidal mesh
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[3] Quentin F. Stout,et al. Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.
[4] William J. Dally,et al. Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.
[5] Daniel H. Linder,et al. An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.
[6] John P. Robinson. Aliasing Probabilities for Feedback Signature Compression of Test Data , 1991, IEEE Trans. Computers.
[7] Hao Li,et al. Mengerian properties, hamiltonicity, and claw-free graphs , 1994, Networks.
[8] Yuh-Dauh Lyuu,et al. A graph-theoretical study of transmission delay and fault tolerance , 1994 .
[9] Yoshiyasu Ishigami,et al. The wide-diameter of the n-dimensional toroidal mesh , 1996 .
[10] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.
[11] Xie Xin,et al. (n,2n)-Dominating Numbers of Undirected Toroidal Mesh C(3,3,…,3) , 2008 .
[12] Michael A. Henning,et al. Domination number in graphs with minimum degree two , 2009 .