On the cyclomatic number of a hypergraph. - B. Devadas Acharya (Discret. Math., 1979)

Spectral criterion for cycle balance in networks. - B. Devadas Acharya (J. Graph Theory, 1980)

Connected graphs switching equivalent to their iterated line graphs. - B. Devadas Acharya (Discret. Math., 1982)

Even edge colorings of a graph. - B. Devadas Acharya (J. Comb. Theory B, 1983)

Arithmetic graphs. - B. Devadas Acharya; Suresh Manjanath Hegde (J. Graph Theory, 1990)

Strongly indexable graphs. - B. Devadas Acharya; Suresh Manjanath Hegde (Discret. Math., 1991)

Domination in graphoidal covers of a graph. - B. Devadas Acharya; Purnima Gupta (Discret. Math., 1999)

On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets. - B. Devadas Acharya; Purnima Gupta (Discret. Math., 1999)

A New Characterisation of Connected Hypergraphs. - B. Devadas Acharya; Mukti Acharya (Electron. Notes Discret. Math., 2003)

On graphs whose domination numbers equal their independent domination numbers. - B. Devadas Acharya; Purnima Gupta (Electron. Notes Discret. Math., 2003)

On The Complement Of An Ambisidigraph. - B. Devadas Acharya; Shalini Joshi (Electron. Notes Discret. Math., 2003)

DDR Graphs of Diameter Three. - Medha Huilgol; Hanumappa B. Walikar; B. Devadas Acharya (Electron. Notes Discret. Math., 2003)

Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering. - E. Sampathkumar 001; B. Devadas Acharya; Purnima Gupta (Electron. Notes Discret. Math., 2003)

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers. - E. Sampathkumar 001; B. Devadas Acharya; Siddani Bhaskara Rao; Sheshayya A. Choudum (Electron. Notes Discret. Math., 2003)

Super magical Partitions of an Integer. - E. Sampathkumar S. R. Sudarshan; B. Devadas Acharya; Suresh Nayak (Electron. Notes Discret. Math., 2003)

Spectra and energies of iterated line graphs of regular graphs. - Harishchandra S. Ramane; Hanumappa B. Walikar; Siddani Bhaskara Rao; B. Devadas Acharya; Prabhakar Ramrao Hampiholi; Sudhir R. Jog; Ivan Gutman (Appl. Math. Lett., 2005)

Hypergraceful complete graphs. - Siddani Bhaskara Rao; B. Devadas Acharya; Tarkeshwar Singh; Mukti Acharya (Australas. J Comb., 2010)

Designs associated with maximum independent sets of a graph. - Hanumappa B. Walikar; B. Devadas Acharya; Shailaja S. Shirkol (Des. Codes Cryptogr., 2010)

Some Reflections on Discrete Mathematical Models in Behavioral, Cognitive and Social Sciences. - B. Devadas Acharya; Shalini Joshi (Proof, Computation and Agency, 2011)

Supra-Hereditary Properties of Hypergraphs. - B. Devadas Acharya (Math. Comput. Sci., 2011)

On graphs whose graphoidal domination number is one. - B. Devadas Acharya; Purnima Gupta; Deepti Jain (AKCE Int. J. Graphs Comb., 2015)