Proper $D$-lucky edge labeling of human chain graphs

Articles in Press

Document Type : Original paper

Authors

1 Department of Mathematics, Shrimathi Devkunvar Nanalal Bhatt Vaishnav College for Women (Autonomous), Chennai 44, India

2 Department of Mathematics, Sri Sairam Engineering College (Autonomous), Chennai 44, India

Abstract

This paper determines the proper $D$-Lucky edge numbers for human chain graphs, circular human chain graphs, strong human chain graphs, and weak human chain graphs.

Keywords

Main Subjects

References

[1] K. Anitha and B. Selvam, Lucky labeling on human chain graph, J. Appl. Sci. Comput. 6 (2019), no. 6, 1545–1565.
[2] N. DEO, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall India Pvt., Limited, 2004.
[3] M Miller, I. Rajasingh, D.A. Emilet, and D.A. Jemilet, d-lucky labeling of graphs, Procedia Comput. Sci. 57 (2015), 766–771.  https://doi.org/10.1016/j.procs.2015.07.473
[4] G. Rajini Ram, S. Hemalatha, and K. Anitha, d-lucky edge labeling of path families, AIP Conf. Proc. 2282 (2020), no. 1, Article ID: 020032. https://doi.org/10.1063/5.0028309
[5] G. Rajini Ram, S. Hemalatha, and K. Anitha, D-lucky edge labeling of strong and weak human chain networks, J. Phys.
Conf. Ser. 1724 (2021), Article ID: 012031.  http://doi.org/10.1088/1742-6596/1724/1/012031
Communications in Combinatorics and Optimization

Articles in Press, Accepted Manuscript
Available Online from 05 August 2025

Files

Share

How to cite

Statistics