| Hamiltonian-n*-laceable graphs TSNDR Murali Journal of Intelligent System Research 3 (1), 18, 2009 | 21* | 2009 |
| Laceability in distance graphs TSNDR Murali Journal of Analysis and Computation 5 (1), 13, 2009 | 5* | 2009 |
| Secure and Efficient energy –Awaresecure routing (EASER) protocol for wireless sensor networks DT S N IJCSMC 6 (4), 5, 2017 | | 2017 |
| Map reduction and parallel processing using Big Data DTSN Vikas S International Journal of Information Technology and Computer Engineering, 3, 2016 | | 2016 |
| Twin sort Tecnique D thimmaraju S N International Journal of Combined Research & Development 3 (4), 3, 2014 | | 2014 |
| Analysis and Performance Evaluation of BWR Mechanism in MAC 802.16 for WiMAX T S.N International Journal of Power Signal and Computation 4 (2), 8, 2012 | | 2012 |
| The power of graphs TSNDR Murali Journal of Analysis and Computation 7 (1), 10, 2011 | | 2011 |
| Decomposition of edge deleted complete graph TSNDR Murali Journal of Analysis and Computation 5 (2), 8, 2010 | | 2010 |
| Decomposition of edge deleted complete graphs into Hamiltonian-2-Laceable paths TSNDR Murali Far East Journal of Applied Mathematics 18 (1), 28, 2005 | | 2005 |
| The Bc-block graph of a graph TSNDR Murali Far East Journal of Applied Mathematics 20 (3), 10, 2005 | | 2005 |
