期刊文献+

超立方体三次幂的可区别数研究 被引量:7

On the distinguishing number of the cube of the hypercube
原文传递
导出
摘要 根据d维超立方体p次幂结构特性,研究了其顶点间距离与海明距离的关系,给出了确定顶点坐标的充分必要条件,并对d维超立方体三次幂H3d的可区别数进行了研究.得到H3d可区别数的一个上界:D(H3d)≤5(d≥6). This paper studied the relations between the distance and hamming distance between its vertices, and presented the sufficient and necessary conditions for determining the vertex coordinate based on the structural properties of the p powers of the d - dimensional hypercube, and studied the distinguishing number of the cube of the d(≥6) -dimensional hypercube. Finally a correlative conclusion D (Hd^3)≤5 (d≥6) was obtained.
出处 《大连海事大学学报》 CAS CSCD 北大核心 2006年第2期121-126,共6页 Journal of Dalian Maritime University
关键词 图论 可区别数 超立方体 图着色 graph theory distinguishing number hypercube graph coloring
  • 相关文献

参考文献5

  • 1ALBERTSON M,COLLINS K. Symmetry breaking in graphs[J]. Electron J Combin, 1996(3) : 1-17.
  • 2BOGSTAD B, COWEN L. The distinguishing number of the hypercube[J]. Discrete Mathematics, 2004,283: 29-35.
  • 3CHENG C C T. Three problems in graph labeling[D]. [S. l.] :Johns Hopkins University. 1999:1-165.
  • 4POTANKA K. Groups, graphs and symmetry breaking[ D]. [ S. l. ] : Virginia Polytechnic Institute, 1998:1-63.
  • 5RUSSELL A, SUNDARAM R. A note on the asymptotics and computational complexity of graph distinguishability[J].Electron J Combin, 1998(5) : 1-7.

同被引文献43

  • 1朱强,徐俊明.立方体和折叠立方体的限制边连通度和超边连通度(英文)[J].中国科学技术大学学报,2006,36(3):249-253. 被引量:18
  • 2张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报(中文版),2006,49(3):703-708. 被引量:97
  • 3Albertson M, Collins K. Symmetry breaking in graphs [J].Electron. J. Combin, 1996(3) :1-17.
  • 4Cheng C C T. Three problems in graph labeling[D]. Johns Hopkins university, 1999.
  • 5Potanka K. Groups, graphs and symmetry breaking [D]. Virginia Polytechnic Institute, 1998.
  • 6Russell A,Sundaram R. A note on the asymptotics and computational complexity of graph distinguishability[J]. Elecetron. J. Combin, 1998(5) : 1-7.
  • 7Bill B, Lenorej, Cowen. The distinguishing number of the hypercube[J].Discrete Mathematics, 2004,283 : 29 -35.
  • 8Bela B. Modern Graph theory[M]. New York: Springer, 1998.
  • 9Albertson M, Collins K. Symmetry breaking in graphs[J]. Electron J Combin, 1996 ( 3 ): 1-17.
  • 10Bogstad B, Cowen L. The distinguishing number of the hypercube[J]. Discrete Mathematics, 2004, 283:29-35.

引证文献7

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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