超立方体的边可区别数  

On edge distinguishing number of hypercube

作　　者：高志军[1] 李懿[1] 张绍兵[1] 

机构地区：[1]黑龙江科技学院计算机与信息工程学院,哈尔滨150027

出　　处：《黑龙江科技学院学报》2007年第5期381-383,共3页Journal of Heilongjiang Institute of Science and Technology

摘　　要：针对图(点)可区别数,提出了图的边可区别数,给出了n阶路Pn和n阶圈Cn的边可区别数;根据n维超立方体Hn及其p次幂Hpn的结构特性,对n维超立方体Hn和n维超立方体p(>2)次幂Hnp的边可区别数进行了研究,得到了n维超立方体及其高次幂Hpn的边可区别数的一个上界。即,当n=2时,H2的边可区别数为3;当n≥3时,Hn的边可区别数为2;当n≥4,n≥p>2时,Hpn的边可区别数小于等于3。Based on the distinguishing number of graph, this paper proposes the edge number of graph, and offers the edge nguish Pn. According to the structural properties of the this paper studies the edge distinguishing number ing number of the n-vertex cycle Cn and the n-dimensional hypercube graph Ho and its of the n-dimensional hypercube graph Hn, an powers of the n-dimensional hypercube graph Hn^P, and gives the mensional hypercube graph, and an upper boundary of the p （ 〉 2 graph, namely, the edge distinguishing number of graph H2 is 3 boundary of the edge distinguishing number of graph Hn^P is 3 for distinguishing n-vertex path p powers Hn^P, d the p（〉2） edge distinguishing number of the n-dipowers of the n-dimensional hypercube for n =2 ,and 2 for n≥3 ,and the upper n≥4 and n≥p 〉2.

关 键 词：图着色 边可区别数 可区别数 超立方体 

分 类 号：O157.6[理学—数学]