摘要
首先给出了图G=V,E为k-边优美的充分条件,根据正则图的特殊性质,讨论了Cm×Cn为k-边优美图的必要条件.利用递归方法构造k-边优美图标号并给出详细证明,从而完全解决了Cm×Cn的边优美指标集问题.
The sufficient condition is given out which G = (V, E) is said to be k-edge-graceful graph. And by the especial property of regular graph, the necessary condition which the graph Cm×Cn is k-edge-graceful is discussed. A method to construct k-edge-graceful graph Cm×Cn is given out by recursion and the problem of what sets of natural numbers are the edge-graceful indices of graph Cm×Cn is completely dissolved.
出处
《江汉大学学报(自然科学版)》
2006年第3期16-18,共3页
Journal of Jianghan University:Natural Science Edition