Author:
Kumar T. V. Sateesh,Meenakshi S.
Publisher
Springer Nature Singapore
Reference13 articles.
1. Ahadi, A., A. Dehghan, M. Kazemi, and E. Mollaahmadi. 2012. Computation of lucky number of planar graphs is NP-hard. Information Processing Letters 112: 109–112.
2. Akbari, S., M. Ghanbari, R. Manaviyat, and S. Zare. 2013. On the lucky choice number of graphs and combinatorics 29: 157–163.
3. Amit, Rokad, and Kalpesh Patadiya. 2017. Cordial labeling of some graphs. Aryabhatta Journal of Mathematics and Informatics 9: 2394–9309.
4. Daoud, S.N. 2012. Complexity of cocktail party graph and crown graph. American Journal of Applied Sciences 9: 202.
5. Gallian Joseph. 2019. A dynamic survey of graph labeling Electron Journal Combinatorics DS 6.