| Local distance antimagic vertex coloring of graphs T Divya, SD Yamini arXiv preprint arXiv:2106.01833, 2021 | 5 | 2021 |
| Counting maximal independent sets in power set graphs MA Shalu, SD Yamini Indian Institute of Information Technology Design & Manufacturing (IIITD&M …, 2014 | 3 | 2014 |
| An algorithmic approach to antimagic labeling of edge corona graphs D Nivedha, SD Yamini arXiv preprint arXiv:2211.16875, 2022 | 2 | 2022 |
| Graceful coloring of ladder graphs D Laavanya, SD Yamini arXiv preprint arXiv:2211.15904, 2022 | 2 | 2022 |
| On the algorithmic aspects of strong subcoloring MA Shalu, S Vijayakumar, SD Yamini, TP Sandhya Journal of Combinatorial Optimization 35, 1312-1329, 2018 | 2 | 2018 |
| Antimagic Labeling of Generalized Edge Corona Graphs D Nivedha, SD Yamini arXiv preprint arXiv:2311.10335, 2023 | | 2023 |
| A structural approach to the graceful coloring of a subclass of trees L D, SD Yamini Heliyon 9 (9), 2023 | | 2023 |
| One-Three Join: A Graph Operation and Its Consequences MA Shalu, SD Yamini Discussiones Mathematicae Graph Theory 37 (3), 633-647, 2017 | | 2017 |
| Tent and a subclass of P5-free graphs MA Shalu, SD Yamini Electronic Notes in Discrete Mathematics 53, 73-82, 2016 | | 2016 |
| A Generalization of Join and an Algorithmic Recognition Problem MA Shalu, S Devi Yamini Fundamenta Informaticae 145 (1), 81-91, 2016 | | 2016 |
