Abstract: In 1994，Mitchem and Simoson introduced the notion of super edge-graceful graphs when they studied the problem of labeling graph. In the course of subsequent study，it was proven that some graphs were super edge-graceful and some conjections on super edge-graceful graphs were introduced. The super edge-graceful labelings of the dandelion graphs are constructed by recursion，and it is proven that dandelion graphs are super edge-graceful graphs.

Key words: super-edge-graceful, dandelion graph, edge sign matrix