期刊文献+

超立方体网络的(d,k)控制数 被引量:1

(d,k)-Dominating Numbers of Hypercube Networks
下载PDF
导出
摘要 (d,k)控制数是刻画容错网络中资源共亨可靠性的一个新参数.本文考虑了k维超立方体Qk的(d,k)控制数,得到:γ1,k(Qk)=2k-1(k>1);d=[k/2]+1(k>2)时,γd,k(Qk)=2;d≤[k/2](k≥4)时,3≤γd,k(Qk)≤2k-d+1;以及若d为正整数,且[k/d]=[k/(d-1)]+1,则γd,k(Qk)=γd,k(Qk),其中[k/d].d+1≤k1≤k. The (d,k)-dominating number is a new measure to characterize reliability of resoures-shring in fault tolerant networks. This paper considers the (d,k)-dominating number of the k-dimensional hypercube net-work and obtains γ1,k(Qk)=2^k-1(k〉1)for d=[k/2]+1(k〉2),γd,k(Qk)=2 for d≤[k/2](k≥4)and γd,k1(Qk)=γd,k(Qk),for given values d if [k/d]=[k/d-1]+1,where[k/d]·d+1≤k1≤k.
作者 谢歆 徐俊明
出处 《数学研究》 CSCD 2007年第2期217-222,共6页 Journal of Mathematical Study
基金 国家自然科学基金(10671191) 安徽省高等学校青年教师科研资助计划项目(2005jk1141)
关键词 可靠性 宽直径 超立方体网络 (d k)控制数 Reliability Wide-diameter Hypercube Network (d,k)-dominating number
  • 相关文献

参考文献2

二级参考文献12

  • 1HSU D F, LYNU Y D. A graph-theoretical study of transmission delay and fault tolerance [A]. Proc. of 4th ISMM International Conference on Paralled and Distributed Computing and Systems [C]. 1991, 20-24.
  • 2FLANDRIN E, LI H. Mengerian properties, hamiltonicity, and claw-free graphs [J]. Networks, 1994, 24:660-678.
  • 3ARMSTRONG J R, GRAY F G. Fault diagnosis in a Boolean n-cube array of microprocessors [J]. IEEE Trans. Comput., 1981, 30(8): 587-590.
  • 4SAAD Y, SCHUTLZ M H. Topological properties of hypecubes [J]. IEEE Trans. Comput., 1988, 37(7):867-872.
  • 5Bondy,J.A. and Murty, U.S.R., GraphTheory with Applications, M acmillan Press, London, 1976.
  • 6Flandrin, E. and Li, H., Mengerian properties, Hamiltonicity and claw- free graphs,Networks, 1994,24:660-678.
  • 7Hsu, D.F. and Lyuu,Y.D., A graph-theoretical study of transmission del ay andfault-tolerance, Proc. of 4th ISMM International Conference on Paralled and DistributedComputing and Systems, 1991,20-24.
  • 8Hsu, D.F. and Luszak,T., Note on the k-diameter of k-regula r k-connected graphs,Disc. Math., 1994,132:291-296.
  • 9Hsu,D.F., On container width and length in graphs, groups, and networ ks, IEICETrans. Fundam,E(77A), 1994,668-680.
  • 10Ishigami,Y., The wide-diameter of the n-dimensional toroidal me sh, Networks,1996,27:257-266.

共引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部