Proper d-Lucky Labeling of Rooted Products and Corona Products of Certain Graphs

Chiranjilal Kujur

doi:10.17485/IJST/v15i39.1154

Article

Proper d-Lucky Labeling of Rooted Products and Corona Products of Certain Graphs

VIEWS 504
PDF 169

Indian Journal of Science and Technology

DOI: 10.17485/IJST/v15i39.1154

Year: 2022, Volume: 15, Issue: 39, Pages: 2021-2026

Original Article

Proper d-Lucky Labeling of Rooted Products and Corona Products of Certain Graphs

Chiranjilal Kujur^1*

¹Assistant Professor, St. Joseph’s College, West Bengal - 734426, India

*Correspponding Author
Email: [email protected]

Received Date:31 May 2022, Accepted Date:10 August 2022, Published Date:17 October 2022

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

Objectives: To examine rooted products graph and corona product of path graph with itself and cycle graph with itself for the existence of d-lucky labeling. Methods: In this study, d-lucky number for Rooted product graph of path graph to path graph (Pn ◦ Pn) and Corona product graph (Pn⊙ Pn) are computed. Method of construction is used throughout this paper to prove the theorems. Findings: Rooted products and corona products of path with itself and cycle graph with itself admit d-lucky labeling and d-lucky numbers for the same are obtained. Novelty: d-lucky numbers for some graphs are obtained by some authors but for rooted product of path with itself and corona products of path with itself and cycle with itself are new findings.

Keywords: Proper Lucky labeling; Rooted product; corona product; d-lucky; d-lucky labeling

References

Kumar TV, Meenakshi S. Lucky and Proper Lucky Labeling of Quadrilateral Snake Graphs. IOP Conference Series: Material Science and Engineering. 2021;1085:12039. Available from: https://doi.org/10.1088/1757-899X/1085/1/012039
Esakkiammal E, Thirusangu K, Seethalakshmi S. Proper d-Lucky labeling on arbitrary super subdivision of some graphs”. Journal of Applied Science and Computation. 2019;6(1):595–602. Available from: http://www.j-asc.com/gallery/71-january-2019.pdf
Miller M, Rajasingh I, Emilet DA, Jemilet DA. d-Lucky Labeling of Graphs. Procedia Computer Science. 2015;57:766–771. Available from: https://doi.org/10.1016/j.procs.2015.07.473
Klavzar S, Rajasingh DI, Emilet. A Lower bound and several Exact Results on the d-lucky number”. Combinatorics. 2019;p. 1–12. Available from: arXvi:1903.07863

Copyright

© 2022 Kujur. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)