伪完全二分图PK_(n,n)奇优美标号的计算机实现  

Cyber Realization of Odd-Graceful Labelings of Pseudo-complete Bipartite Graph PK_(n,n)

作　　者：陈璟[1] 祁丽娟[2] 王蓓蓓[1] 刘信生[1] 

机构地区：[1]西北师范大学数学与统计学院,甘肃兰州730070 [2]兰州工业学院基础科学部,甘肃兰州730050

出　　处：《数学的实践与认识》2016年第8期193-198,共6页Mathematics in Practice and Theory

基　　金：国家自然科学基金(61163054;61363060)

摘　　要：给出了伪完全二分图PK_(n,n)的定义及性质,提出了该类图的奇优美标号算法,证明了算法的正确性及时间复杂度,从而证明了伪完全二分图的奇优美性.并给出了伪完全二分图PK_(n,n),当n=3,4,5的一种标号方法.The definition and properties of the pseudo-complete bipartite graph PKn,n were given in this paper.We proposed odd graceful labeling algorithm of the graphs of its kind and proved the correctness of the algorithm and the complexity of time,which proves the odd gracefulness of the pseudo-complete bipartite graph PKn,n.In addition,we gave a labeling method of pseudo-complete bipartite graph as n=3,4,5.

关 键 词：伪完全二分图 奇优美标号 算法 

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