1. Bounds for the covering number of a graph;Abbott;Discrete Math.,1979
2. The strong domination number of a graph and related concepts;Acharya;J. Math. Phys. Sci.,1980
3. B.D. Acharya, H.B. Walikar. Bounds on the size of a graph having unique minimum dominating set, manuscript, undated.
4. B.D. Acharya, H.B. Walikar. Indominable graphs cannot be characterized by a finite family of forbidden subgraphs, manuscript, undated.
5. On graphs having unique minimum dominating sets;Acharya;Graph Theory Newsletter,1979