完备二分图的冠的k-优美性  

The k-Gracefulness of the Coronal of Complete Bipartite Graphs

作　　者：刘育兴[1] 

机构地区：[1]赣南师范学院数学与计算机科学学院,江西赣州341000

出　　处：《赣南师范学院学报》2010年第3期11-13,共3页Journal of Gannan Teachers' College(Social Science(2))

摘　　要：图的优美性是图的一个重要性质,有广泛的应用.马克杰猜想:完备二分图Km,n的冠I(Km,n)是k-优美图,这里m,n,k是任意正整数且m n.对于m=2,3,4,5或k>(m-1)n的情形,利用构造的方法,证明了猜想的正确性.这一结果丰富了优美图理论.The gracefulness of graphs is an important quality,having widespread application.Ma kejie guessed that the coronal of any complete bipartite graphis a-graceful graph,where is any positive integer.It is proved that this conjecture is true by the construction method for m=2,3,4,5 or k（m-1）n.The result enriches the graceful theory of graphs.

关 键 词：完备二分图 优美图 冠 构造方法 

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