| A totally magic cordial labeling of one-point union of n copies of a graph P Jeyanthi, N Angel-Benseera Opuscula Mathematica 34 (1), 2014 | 9 | 2014 |
| On totally magic cordial labeling P Jeyanthi, NA Benseera, MI Mary SUT Journal of Mathematics 49 (1), 13-18, 2013 | 8 | 2013 |
| Totally magic cordial deficiency of some graphs P Jeyanthi, NA Benseera Utilitas Mathematica 105, 2017 | 5 | 2017 |
| Totally magic cordial labeling of some graphs P Jeyanthi, N Angel Benseera Journal of Algorithms and Computation 46 (1), 1-8, 2015 | 5 | 2015 |
| On k-Totally magic cordial labeling of graphs P Jeyanthi, NA Benseera, GC Lau Discrete Mathematics, Algorithms and Applications 7 (03), 1550024, 2015 | 3 | 2015 |
| Hypo-k-totally magic cordial labeling of graphs P Jeyanthi, N Angel Benseera, GC Lau Proyecciones (Antofagasta) 34 (4), 351-359, 2015 | 2 | 2015 |
| Totally magic cordial labeling of mPn and mKn P Jeyanthi, N Angel Benseera, I Cahit Proyecciones (Antofagasta) 35 (4), 371-380, 2016 | 1 | 2016 |
| Totally vertex-magic cordial labeling P Jeyanthi, NA Benseera SUT Journal of Mathematics 49 (1), 1-12, 2013 | 1 | 2013 |
