图K_1×m∪t=1C_((2n)_t)的边优美指标集和超边优美标号  

On the Edge-graceful Indices and Super-edge-graceful Labelings of the Graph K_1×m∪t=1C_((2n)_t)

作　　者：贾慧羡[1] 左大伟[2] 

机构地区：[1]石家庄邮电职业技术学院基础部,河北石家庄050021 [2]石家庄铁道大学数理系,河北石家庄050043

出　　处：《石家庄铁道大学学报（自然科学版）》2012年第4期102-108,共7页Journal of Shijiazhuang Tiedao University(Natural Science Edition)

摘　　要：对于非负整数k,讨论了图K1×m∪t=1C2nt为k-边优美图的必要条件,给出了构造该图k-边优美的一般步骤,进而利用递归方法构造k-边优美图标号并给出详细证明,从而完全解决了图K1×m∪t=1C2nt的边优美指标集问题。最后,证明了该图是超边优美图。For a nonnegative integer , the necessary condition in which the graph K1×m∪t=1C2ntis k -edge-graceful is discussed, and the methods and steps to construct k -edge-graceful graph K1×m∪t=1C2nt are given. Then the k -edge-graceful labeling is constructed by recursion and the problem of what sets of natural numbers are the edge-graceful-indices of graph K1×m∪t=1C2nt is completely resolved. Finally, that the graph is a super-edge-graceful graph is proved.

关 键 词：k-边优美 边优美指标集 超边优美图 图K1×m∪t=1C2nt 

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