A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm-Reference-Cited by-同舟云学术

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

Published:2021-08-23 Issue: Volume:20 Page:378-386
ISSN:2224-2880
Container-title:WSEAS TRANSACTIONS ON MATHEMATICS
language:en
Short-container-title:

Author:

Taweel Faris M.¹,Abuhijleh Eman A.²,Ali Shorouq³

Affiliation:

1. Software Engineering, Al-Ahliyya Amman University, 19328 Amman, JORDAN

2. Zarqa University College, Al-Balqa Applied University, Zarqa, JORDAN

3. Princess Sumaya University for Technology, 11941 Amman, JORDAN

Abstract

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.

Publisher

World Scientific and Engineering Academy and Society (WSEAS)

Subject

General Mathematics

Reference32 articles.

1. A. Rosa, On certain valuations of the vertices of a graph, in: In Proceedings of the International Symposium of the Theory of Graphs, International Computing Centre, Rome, July, 1966.

2. Golomb, Graceful Graphs, W. H. Freeman, Ch. 15, pp. 152-165.

3. T. Redl, Graceful graphs and graceful labelings: Two mathematical formulations and some other new results, Congr. Numer. 164 (2003) 17-31.

4. Vesel, Aleksander and Shao, Zehui and Deng, Fei and Li, Zepeng, Graceful labelings of the generalized petersen graphs, Communications in Combinatorics and Optimization 2 (2) (2017) 149-159. doi:DOI:10.22049/CCO.2017.25918.1055.

5. R. L. Grahams, N. J. A. Sloane, On additive bases and harmonious graphs, SIAM Journal on Algebriac and Discrete Methods 1 (1980) 382-404.