Faris M.Taweel, Eman A. Abuhijleh, Shorouq Ali, "A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm," WSEAS Transactions on Mathematics, vol. 20, pp. 378-386, 2021, DOI:10.37394/23206.2021.20.39
Faris M.Taweel, Eman A. Abuhijleh, Shorouq Ali. A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm.
WSEAS Transactions on Mathematics. 2021;20:378-386. 10.37394/23206.2021.20.39
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 20, 2021
A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm
Authors: , ,
Abstract: A method for relaxed graceful labeling of P<sup>2</sup><sub>n</sub> 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(n<sup>2</sup>)). The algorithm can be used for labeling any P<sup>2</sup><sub>n</sub> graph with n ≥ 3, as far as the machine can handle the size of the problem.
Keywords:
Graceful graph, square of path, algorithm, polynomial complexity, range-relaxed graceful (RRG).
Pages: 378-386 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 20, 2021, Art. #39 DOI: 10.37394/23206.2021.20.39
×
Citation Tools