非连通图Kn,m∪G的优美性研究

摘要

对非连通图的优美性进行了研究,给出了几类非连通的并图,得出了如下结论：对任意正整数m,n,设G2n是任一边数为2n的优美图,当1≤n≤m时,非连通图Kn,m∪G2n是优美图;对任意正整数m,n,t,当1≤n≤m,且n≤t时,、非连通图Kn,m∪（C3∨Kt）和Kn,m∪（P3∨Kt）是优美图。%Gracefulness of non-connected graph was studied and types of non-connected union graphs were given.The conclusions were obtained as：For random positive integer m,n,assuming G2n was a graceful graph for edges of 2n,as for 1≤n≤m,non-connected graph Kn,m∪G2n was a graceful graph;for random positive integer m,n,t,as for 1≤n≤m,and n≤t,non-connected graph Kn,m∪（C3∨Kt-） and Kn,m∪（P3∨Kt-） were graceful graphs.