Open AccessA Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm
Author(s) -
Faris M. Taweel,
Eman A. AbuHijleh,
Shorouq Ali
Publication year - 2021
Publication title -
wseas transactions on mathematics
Language(s) - English
Resource type - Journals
eISSN - 2224-2880
pISSN - 1109-2769
DOI - 10.37394/23206.2021.20.39
Subject(s) - graph , computer science , algorithm , graph labeling , quadratic equation , range (aeronautics) , computational complexity theory , path (computing) , square (algebra) , combinatorial algorithms , combinatorics , mathematics , theoretical computer science , line graph , voltage graph , engineering , geometry , programming language , aerospace engineering
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.