Two kinds of unconnected graphs (K2〖TX-〗∨Cn)∪[DD(]3[]i=1[DD)]St(mi) and (K2〖TX-〗∨C2n+k)∪St(m)∪G(k)n-1(k=1,2) were presented, and following results were proved: for natural number n, m, m1, m2, m3, let s=〖JB(［〗〖SX(〗n〖〗2〖SX)〗〖JB)］〗, n≥9, m1≥s+2, then graph (K2〖TX-〗∨Cn)∪[DD(]3[]i=1[DD)]St(mi) is a graceful graph; for k=1,2, let n, m≥3, and let G(k)n-1 be a k-graceful graph with n-1 edges, then graph (K2〖TX-〗∨C2n+k)∪St(m)∪G(k)n-1 is a graceful graph. Where K2 bea complete graph with 2 vertices, K2〖TX-〗 is the complement of graph K2, graph K2〖TX-〗∨Cn is the join graph of K2〖TX-〗 and n-cycle Cn, St(m) isa star tree with m+1 vertices.