Author:
Kumar T. V. Sateesh,Meenakshi S.
Reference15 articles.
1. Computation of lucky number of planar graphs is NP-hard
2. On the Lucky Choice Number of Graphs
3. Amit Rokad and Patadiya Kalpesh. Cordial Labeling of Some Graphs. Aryabhatta Journal of Mathematics and Informatics. 9, 2394–9309 (2017).
4. Gallian J A., Electronic Journal of Combinatorics (DynamicSurveys, 2018), DS6.
5. Edge weights and vertex colours