2005 |
13 | EE | Harishchandra S. Ramane,
Hanumappa B. Walikar,
Siddani Bhaskara Rao,
B. Devadas Acharya,
Prabhakar Ramrao Hampiholi,
Sudhir R. Jog,
Ivan Gutman:
Spectra and energies of iterated line graphs of regular graphs.
Appl. Math. Lett. 18(6): 679-682 (2005) |
2003 |
12 | EE | Medha Huilgol,
Hanumappa B. Walikar,
B. Devadas Acharya:
DDR Graphs of Diameter Three.
Electronic Notes in Discrete Mathematics 15: 103 (2003) |
11 | EE | E. Sampathkumar S. R. Sudarshan,
B. Devadas Acharya,
Suresh Nayak:
Super magical Partitions of an Integer.
Electronic Notes in Discrete Mathematics 15: 161-163 (2003) |
10 | EE | E. Sampathkumar,
B. Devadas Acharya,
Siddani Bhaskara Rao,
Sheshayya A. Choudum:
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.
Electronic Notes in Discrete Mathematics 15: 164-167 (2003) |
9 | EE | E. Sampathkumar,
B. Devadas Acharya,
Purnima Gupta:
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering.
Electronic Notes in Discrete Mathematics 15: 168-174 (2003) |
8 | EE | B. Devadas Acharya,
Purnima Gupta:
On graphs whose domination numbers equal their independent domination numbers.
Electronic Notes in Discrete Mathematics 15: 2-4 (2003) |
7 | EE | B. Devadas Acharya,
Shalini Joshi:
On The Complement Of An Ambisidigraph.
Electronic Notes in Discrete Mathematics 15: 5 (2003) |
6 | EE | B. Devadas Acharya,
Mukti Acharya:
A New Characterisation of Connected Hypergraphs.
Electronic Notes in Discrete Mathematics 15: 6-9 (2003) |
1999 |
5 | EE | B. Devadas Acharya,
Purnima Gupta:
On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets.
Discrete Mathematics 195(1-3): 1-13 (1999) |
4 | EE | B. Devadas Acharya,
Purnima Gupta:
Domination in graphoidal covers of a graph.
Discrete Mathematics 206(1-3): 3-33 (1999) |
1991 |
3 | EE | B. Devadas Acharya,
S. M. Hegde:
Strongly indexable graphs.
Discrete Mathematics 93(2-3): 123-129 (1991) |
1983 |
2 | EE | B. Devadas Acharya:
Even edge colorings of a graph.
J. Comb. Theory, Ser. B 35(1): 78-79 (1983) |
1982 |
1 | EE | B. Devadas Acharya:
Connected graphs switching equivalent to their iterated line graphs.
Discrete Mathematics 41(2): 115-122 (1982) |