Journal of
Combinatorial Mathematics and
Combinatorial Computing
Volume 84, February, 2013
NCTCSDM, India 2012
- Belmannu Devadas Acharya, “Domination and absorbance in signed graphs and digraphs: I. Foundations”, pp. 5-20
- R. Anantha Kumar and S. Arumugam, “Pairwise distance similar sets in graphs”, pp. 21-28
- Ashwin Ganesan, “On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees”, pp. 29-40
- T.A. Chishti and U. Samee, “On mark sequences in bipartite digraphs”, pp. 41-49
- P. Hemalatha and A. Muthusamy, “Sk-Factorization of complete multipartite symmetric digraphs”, pp. 51-60
- N. Kamatchi and S. Arumugam, “Distance antimagic graphs”, pp. 61-67
- R. Lakshmanan, S. Arumugam and Atulya K. Nagar, “Visual cryptography scheme for the mindom access structure of a graph”, pp. 69-80
- M. Nalliah and S. Arumugam, “Super (a,d)-edge-antimagic total labelings of generalized friendship graphs”, pp. 81-90
- H.P. Patil and R. Pandiya Raj, “Characterizations of k-ctrees and graph valued functions”, pp. 91-98
- S. Pirzada, “Hypertournaments-scores, losing scores, total scores and degrees”, pp. 99-112
- A.S. Prasanna Venkatesan, D.G. Thomas and S. Hemalatha, “Hexagonal splicing P system”, pp. 113-126
- R. Sampathkumar and P. Kandan, “P4-Factorization of Cartesian product of complete graphs”, pp. 127-135
- R. Sangeetha and A. Muthusamy, “Hamilton-Waterloo problem: Existence of larger order from smaller order”, pp. 137-143
- A.P. Santhakumaran and T. Kumari Latha, “The total open geodetic number of a graph”, pp. 145-154
- A.P. Santhakumaran, T. Jebaraj and S.V. Ullas Chandran, “The monophonic detour hull number of a graph”, pp. 155-165
- Krishnaiyan Thulasiraman and Ming-Shan Su, “Diagnosis in a network of processors: Centralized and distributed models and algorithms”, pp. 167-178
- P. Titus, K. Ganesamoorthy and P. Balakrishnan, “The detour monophonic number of a graph”, pp. 179-188