default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDB. Devadas Acharya
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j20]B. Devadas Acharya, Purnima Gupta, Deepti Jain
:
On graphs whose graphoidal domination number is one. AKCE Int. J. Graphs Comb. 12(Issues): 133-140 (2015)- 2011
- [j19]B. Devadas Acharya:
Supra-Hereditary Properties of Hypergraphs. Math. Comput. Sci. 5(1): 3-6 (2011) - [p1]B. Devadas Acharya, Shalini Joshi:
Some Reflections on Discrete Mathematical Models in Behavioral, Cognitive and Social Sciences. Proof, Computation and Agency 2011: 277-307 - 2010
- [j18]Siddani Bhaskara Rao, B. Devadas Acharya, Tarkeshwar Singh, Mukti Acharya:
Hypergraceful complete graphs. Australas. J Comb. 48: 5-24 (2010) - [j17]Hanumappa B. Walikar, B. Devadas Acharya, Shailaja S. Shirkol:
Designs associated with maximum independent sets of a graph. Des. Codes Cryptogr. 57(1): 91-105 (2010)
2000 – 2009
- 2005
- [j16]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
- [j15]B. Devadas Acharya, Purnima Gupta:
On graphs whose domination numbers equal their independent domination numbers. Electron. Notes Discret. Math. 15: 2-4 (2003) - [j14]B. Devadas Acharya, Shalini Joshi:
On The Complement Of An Ambisidigraph. Electron. Notes Discret. Math. 15: 5 (2003) - [j13]B. Devadas Acharya, Mukti Acharya:
A New Characterisation of Connected Hypergraphs. Electron. Notes Discret. Math. 15: 6-9 (2003) - [j12]Medha Huilgol, Hanumappa B. Walikar, B. Devadas Acharya:
DDR Graphs of Diameter Three. Electron. Notes Discret. Math. 15: 103 (2003) - [j11]E. Sampathkumar S. R. Sudarshan, B. Devadas Acharya, Suresh Nayak:
Super magical Partitions of an Integer. Electron. Notes Discret. Math. 15: 161-163 (2003) - [j10]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. Electron. Notes Discret. Math. 15: 164-167 (2003) - [j9]E. Sampathkumar, B. Devadas Acharya, Purnima Gupta:
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering. Electron. Notes Discret. Math. 15: 168-174 (2003)
1990 – 1999
- 1999
- [j8]B. Devadas Acharya, Purnima Gupta:
On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets. Discret. Math. 195(1-3): 1-13 (1999) - [j7]B. Devadas Acharya, Purnima Gupta:
Domination in graphoidal covers of a graph. Discret. Math. 206(1-3): 3-33 (1999) - 1991
- [j6]B. Devadas Acharya, Suresh Manjanath Hegde:
Strongly indexable graphs. Discret. Math. 93(2-3): 123-129 (1991) - 1990
- [j5]B. Devadas Acharya, Suresh Manjanath Hegde:
Arithmetic graphs. J. Graph Theory 14(3): 275-299 (1990)
1980 – 1989
- 1983
- [j4]B. Devadas Acharya:
Even edge colorings of a graph. J. Comb. Theory B 35(1): 78-79 (1983) - 1982
- [j3]B. Devadas Acharya:
Connected graphs switching equivalent to their iterated line graphs. Discret. Math. 41(2): 115-122 (1982) - 1980
- [j2]B. Devadas Acharya:
Spectral criterion for cycle balance in networks. J. Graph Theory 4(1): 1-11 (1980)
1970 – 1979
- 1979
- [j1]B. Devadas Acharya:
On the cyclomatic number of a hypergraph. Discret. Math. 27(2): 111-116 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
