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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
