Let be two positive integers. For the graph with vertex set and edge set with and , we define two sets and as follows:
For the graph with and , is said to be -super edge-graceful (in short -SEG), if there exists a function pair which assigns integer labels to the vertices and edges; that is, , and such that is onto and is onto , and