In graph theory, an edge-graceful labeling is a type of graph labeling for simple, connected graphs in which no two distinct edges connect the same two distinct vertices and no edge connects a vertex to itself.
Edge-graceful labelings were first introduced by Sheng-Ping Lo in his seminal paper.[1]