Author:
Kumar T. V. Sateesh,Meenakshi S.
Reference10 articles.
1. Computation of lucky number of planar graphs is NP-hard
2. On the Lucky Choice Number of Graphs
3. Badr E M and Abdel-aal M E. Odd International Journal of Soft Computing, Mathematics and Control (IJSCMC) 2, (2013).
4. Gallian Joseph. Electron J Combin DS6 (2019).
5. Edge weights and vertex colours