آمار
| تعداد نشریات | 6 |
| تعداد شمارهها | 121 |
| تعداد مقالات | 1,448 |
| تعداد مشاهده مقاله | 1,555,699 |
| تعداد دریافت فایل اصل مقاله | 1,459,774 |
Proper $D$-lucky edge labeling of human chain graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 14 مرداد 1404 اصل مقاله (414.46 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2025.28529.1601 | ||
| نویسندگان | ||
| G. Rajini Ram* 1، 2؛ S. Hemalatha1؛ K. Anitha2 | ||
| 1Department of Mathematics, Shrimathi Devkunvar Nanalal Bhatt Vaishnav College for Women (Autonomous), Chennai 44, India | ||
| 2Department of Mathematics, Sri Sairam Engineering College (Autonomous), Chennai 44, India | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Proper D-Lucky edge labeling؛ Circular human chain graph؛ Strong human chain graph؛ Weak human chain graph | ||
| مراجع | ||
|
[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 | ||
|
آمار تعداد مشاهده مقاله: 76 تعداد دریافت فایل اصل مقاله: 67 |
||