1. Eulerian hypergraphs. (with Pushpalatha, L.) Adv. Stud. Contemp. Math. (Kyungshang) 8 (2004) 115-119 05C65 (05C45)
   
2. Complement of a graph: a generalization. (with Pushpalatha, L.) Graphs Combin. 14 (1998) 377-392 05C75
   
3. Generalized complements of a graph. (with Pushpa Latha, L., Venkatachalam, C. V., Bhat, Pradeep) Indian J. Pure Appl. Math. 29 (1998) 625-639 05C75
   
4. Strong weak domination and domination balance in a graph. (with L.Pushpa Latha) Discrete Math. 161 (1996) 235-242 05C35 
   
5. Reconstruction of a graph of order p from its (p-1)-complements. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 27 (1996) 435-441 05C60 
   
6. Independent, perfect and connected neighbourhood numbers of a graph. (with Neeralagi, Prabha S.) J. Combin. Inform. System Sci. 19 (1994) 139-145 05C35 (05C40)
   
7. Semi-strong chromatic number of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 26 (1995) 35-40 05C15 
   
8. Bilinear and trilinear partitions of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 25 (1994) 843-850 05C35 
   
9. The global set-domination number of a graph. (with Pushpa Latha, L.) Indian J. Pure Appl. Math. 25 (1994) 1053-1057 05 C35
   
10. Set    domination    in    graphs.    (with    Pushpa    Latha,    L.) J. Graph Theory 18 (1994) 489-495 05C70
    
11. A    generalization    of    chromatic    index.    (with    Kamath,    G.    D.) Discrete Math. 124 (1994) 173-177 05C15 
    
12. Characterizations of a cycle. Math. Student 61 (1992) 238-240 05C38 
    
13. Point-set domination number of a graph. (with Latha, L. Pushpa), Indian J. Pure Appl. Math. 24 (1993) 225-229 05C35 
    
14. Domination and neighbourhood critical, fixed, free and totally free points. (with Neeralagi, Prabha S.) Sankhyã Ser. A 54 (1992) 403-407 05C35 
    
15. Mixed domination in graphs. (with Kamath, S. S.) Sankhyã Ser. A 54 (1992) 399-402 05C35
16. k-size chromatic number of a graph. (with Kamath, G. D.) Sankhyã Ser. A 54 (1992) 393-397 05C15
17. Generalizations of independence and chromatic numbers of a graph. Discrete Math. 115 (1993) 245-251 05C15 (05C35)
18. Chromatically fixed, free and totally free points in a graph. J. Combin. Inform. System Sci. 17 (1992) 130-138 05C15
19. A generalization of Menger's theorem for certain unicyclic graphs. Graphs Combin. 8 (1992) 377-380 05C40
20. The least point covering and domination numbers of a graph. Discrete Math. 86 (1990) 137-142 05C35 (05C70)
21. A    characterization    of    trees. J. Karnatak Univ. Sci. 32 (1987) 192-193 05C05
    
22. The global domination number of a graph. J. Math. Phys. Sci. 23 (1989) 377-385 05C35 (05C70)
    
23. Chromatic partitions of a graph. (with Venkatachalam, C. V.) Discrete Math. 74 (1989) 227-239 05C15
24. Connectivity of a graph---a generalization. J. Combin. Inform. System Sci. 9 (1984) 71-78 05C40
    
25. (1,k)-domination in a graph. J. Math. Phys. Sci. 22 (1988) 613-619 05C35 25. Reconstruction of a disconnected graph from its elementary partition graphs. (with Bhave, V. N.) J. Combin. Inform. System Sci. 9 (1984) 242-246 05C60
    
26. Graphoidal covers and graphoidal covering number of a graph. (with Acharya, B. Devadas) Indian J. Pure Appl. Math. 18 (1987) 882-890 05C38 (05C70)
27. The line neighbourhood number of a graph. (with Neeralagi, Prabha S.) Indian J. Pure Appl. Math. 17 (1986) 142-149 05C99
28. The neighbourhood number of a graph. (with Neeralagi, Prabha S.) Indian J. Pure Appl. Math. 16 (1985) 126-132 05C35
29. A    generalization    of    Menger's    theorem    for    trees. J. Combin. Inform. System Sci. 8 (1983) 79-80 05C05 (05C38)
    
30. On a conjecture of Cockayne and Hedetniemi. (with Walikar, H. B.) J. Combin. Inform. System Sci. 7 (1982) 212-215 05C70 (05C40)
31. Reconstruction of a pair of graphs from their concatenations. (with Kundu, Sukhamay, Shearer, James, Sturtevant, Dean) SIAM J. Algebraic Discrete Methods 1 (1980) 228-231 05C60
32. The connected domination number of a graph. (with Walikar, H. B.) J. Math. Phys. Sci. 13 (1979) 607-613 05C40
33. A generalization of the chromatic and line chromatic numbers of a graph. (with Neeralagi, Prabha S., Venkatachalam, C. V.) J. Karnatak Univ. Sci. 22 (1977) 44- 49 05C15
34. Partition graphs and coloring numbers of a graph. (with Bhave, V. N.) Discrete Math. 16 (1976) 57-60 05C15
35. L-graphical partitions of an even number. J. Karnatak Univ. Sci. 20 (1975) 266-269 05C99
36. Partition graphs of a graph. (with Bhave, V. N.) Progr. Math. (Allahabad) 9 (1975) 33-42 05C99
37. Reconstruction of a tree from its homomorphic images and other related transforms. (with Kundu, Sukhamay, Bhave, V. N.) J. Combin. Theory Ser. B 20 (1976) 117- 123 05C05
38. On tensor product graphs. J. Austral. Math. Soc. 20 (1975) 268-273 05C99
39. On the interchange graph of a finite planar graph. (with Kulli, V. R.) J. Indian Math. Soc. (N.S.) 37 (1973) 339-341 05C10
40. On duplicate graphs. J. Indian Math. Soc. (N.S.) 37 (1973) 285-293 05C99
41. On the line graph of subdivision graph. J. Karnatak Univ. Sci. 17 (1972) 259-260 05C99
    
42. On the minimum number of line-disjoint paths in a finite tree. (with Gudagudi, B.R.) J. Karnatak Univ. Sci. 17 (1972) 257-258 05C05
43. Transitive digraphs and topologies on a set. (with Kulkarni, K. H.) J. Karnatak Univ. Sci. 18 (1973) 266-273 05C20
    
44. Semi-total graphs of a graph. I, II, III. (with Chikkodimath, S. B.) J. Karnatak Univ. Sci. 18 (1973) 274-296 05C99
45. Characterizations of connected graphs. J. Karnatak Univ. Sci. 18 (1973) 312-314 05C99
46. Group valued graphs. (with Bhave, V. N.) J. Karnatak Univ. Sci. 18 (1973) 325-328 05C25
47. Point signed and line signed graphs. Nat. Acad. Sci. Lett. 7 (1984) 91-93 05C75
48. Arbitrarily traceable graphs. (with Bhave, V. N.) Math. Student 43 (1975) 428-430 05C75

Other contributions:

1. Founder of the Ramanujan Mathematical Society (1986)
2. Founder of the Indian Mathematical Consortium (2014)