图C_n×K_2的边优美标号的研究

The Study of Edge-Graaceful Labeling of C_n×K_2 Graph

文章研究了图Cn×K2的边优美性,证明了当n≡1(mod2)时,图Cn×K2不是边优美图,同时给出当n≡0(mod2)时图Cn×K2边优美标号的算法,并利用此算法编写Java程序,得出当n=2,4,6,8,10时图Cn×K2的边优美标号.

We study the edge-gracefulness of graph,and prove that the Cn×K2 graph is not edge-graceful graph when n=1（model）. Meanwhile, we give the algorithm for the graceful labeling of Cn×K2 graph whenn=0（mode 2） ,and make the Java program by using this algorithm. Besides, we obtain the edge-graceful labeling of the Cn×K2 graph when n=2,4,6,8,10.