B. Devadas Acharya - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2015

On graphs whose graphoidal domination number is oneB. Devadas Acharya, Purnima Gupta, Deepti Jain. akcej, 12(Issues):133-140, 2015. [doi]

2010

Hypergraceful complete graphsSiddani Bhaskara Rao, B. Devadas Acharya, Tarkeshwar Singh, Mukti Acharya. ajc, 48:5-24, 2010. [doi]

Designs associated with maximum independent sets of a graphHanumappa B. Walikar, B. Devadas Acharya, Shailaja S. Shirkol. dcc, 57(1):91-105, 2010. [doi]

2005

Spectra and energies of iterated line graphs of regular graphsHarishchandra S. Ramane, Hanumappa B. Walikar, Siddani Bhaskara Rao, B. Devadas Acharya, Prabhakar Ramrao Hampiholi, Sudhir R. Jog, Ivan Gutman. appml, 18(6):679-682, 2005. [doi]

2003

A New Characterisation of Connected HypergraphsB. Devadas Acharya, Mukti Acharya. endm, 15:6-9, 2003. [doi]

On graphs whose domination numbers equal their independent domination numbersB. Devadas Acharya, Purnima Gupta. endm, 15:2-4, 2003. [doi]

On The Complement Of An AmbisidigraphB. Devadas Acharya, Shalini Joshi. endm, 15:5, 2003. [doi]

DDR Graphs of Diameter ThreeMedha Huilgol, Hanumappa B. Walikar, B. Devadas Acharya. endm, 15:103, 2003. [doi]

Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and coveringE. Sampathkumar, B. Devadas Acharya, Purnima Gupta. endm, 15:168-174, 2003. [doi]

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbersE. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum. endm, 15:164-167, 2003. [doi]

Super magical Partitions of an IntegerE. Sampathkumar S. R. Sudarshan, B. Devadas Acharya, Suresh Nayak. endm, 15:161-163, 2003. [doi]

1999

Domination in graphoidal covers of a graphB. Devadas Acharya, Purnima Gupta. DM, 206(1-3):3-33, 1999. [doi]

On point-set domination in graphs IV: Separable graphs with unique minimum psd-setsB. Devadas Acharya, Purnima Gupta. DM, 195(1-3):1-13, 1999. [doi]

1991

Strongly indexable graphsB. Devadas Acharya, S. M. Hegde. DM, 93(2-3):123-129, 1991. [doi]

1990

Arithmetic graphsB. Devadas Acharya, S. M. Hegde. jgt, 14(3):275-299, 1990. [doi]

1983

Even edge colorings of a graphB. Devadas Acharya. JCT, 35(1):78-79, 1983. [doi]

1982

Connected graphs switching equivalent to their iterated line graphsB. Devadas Acharya. DM, 41(2):115-122, 1982. [doi]

1980

Spectral criterion for cycle balance in networksB. Devadas Acharya. jgt, 4(1):1-11, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL