摘要
给出了伪完全二分图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.
出处
《数学的实践与认识》
北大核心
2016年第8期193-198,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(61163054
61363060)
关键词
伪完全二分图
奇优美标号
算法
pseudo-complete bipartite graph
odd graceful labeling
algorithm
