P_2×C_n的k-边优美的图标号

On the Edge-graceful Indices of P_2×C_n

给出了图G=(V,E)为k-边优美的充分条件,根据正则图的特殊性质,讨论了P2×Cn为k-边优美图的必要条件.利用递归方法构造k-边优美图标号并给出详细证明,从而完全解决了P2×Cn的边优美指标集问题.

The condition is given out in which G= （V,E） is said to be k-edge-graceful graph. And by the especial property of regular graph, the necessary condition in which the graph P2×Cn. is kedge-graceful is discussed. A method to construct k-edge-graceful graph P2×Cn. is given out by recursion and the problem of what sets of natural numbers are the edge-graceful indices of graph P2×Cn. is completely resolved.