A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm

A method for relaxed graceful labeling of P2n graphs is presented together with an algorithm designed for labeling these graphs. Graceful labeling is achieved by relaxing the range to 2m and perform the labeling using an algorithm with quadratic complexity (O(n2)). The algorithm can be used for labeling any P2n graph with n ≥ 3, as far as the machine can handle the size of the problem.