 Belmannu Devadas Acharya, "Domination and absorbance in signed graphs and digraphs: I. Foundations", pp. 520
 R. Anantha Kumar and S. Arumugam, "Pairwise distance similar sets in graphs", pp. 2128
 Ashwin Ganesan, "On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees", pp. 2940
 T.A. Chishti and U. Samee, "On mark sequences in bipartite digraphs", pp. 4149
 P. Hemalatha and A. Muthusamy, "S_{k}Factorization of complete multipartite symmetric digraphs", pp. 5160
 N. Kamatchi and S. Arumugam, "Distance antimagic graphs", pp. 6167
 R. Lakshmanan, S. Arumugam and Atulya K. Nagar, "Visual cryptography scheme for the mindom access structure of a graph", pp. 6980
 M. Nalliah and S. Arumugam, "Super (a,d)edgeantimagic total labelings of generalized friendship graphs", pp. 8190
 H.P. Patil and R. Pandiya Raj, "Characterizations of kctrees and graph valued functions", pp. 9198
 S. Pirzada, "Hypertournamentsscores, losing scores, total scores and degrees", pp. 99112
 A.S. Prasanna Venkatesan, D.G. Thomas and S. Hemalatha, "Hexagonal splicing P system", pp. 113126
 R. Sampathkumar and P. Kandan, "P_{4}Factorization of Cartesian product of complete graphs", pp. 127135
 R. Sangeetha and A. Muthusamy, "HamiltonWaterloo problem: Existence of larger order from smaller order", pp. 137143
 A.P. Santhakumaran and T. Kumari Latha, "The total open geodetic number of a graph", pp. 145154
 A.P. Santhakumaran, T. Jebaraj and S.V. Ullas Chandran, "The monophonic detour hull number of a graph", pp. 155165
 Krishnaiyan Thulasiraman and MingShan Su, "Diagnosis in a network of processors: Centralized and distributed models and algorithms", pp. 167178
 P. Titus, K. Ganesamoorthy and P. Balakrishnan, "The detour monophonic number of a graph", pp. 179188
