default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddani Bhaskara Rao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c1]Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo:
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. CALDAM 2021: 259-271- 2020
- [j10]Siddani Bhaskara Rao, Uma Kant Sahoo, V. Parameswaran:
Cycle stochastic graphs: Structural and forbidden graph characterizations. AKCE Int. J. Graphs Comb. 17(3): 1076-1080 (2020)
2010 – 2019
- 2015
- [j9]Siddani Bhaskara Rao, Uma Kant Sahoo:
Embeddings in Eulerian graceful graphs. Australas. J Comb. 62: 128-139 (2015) - 2010
- [j8]Siddani Bhaskara Rao, B. Devadas Acharya, Tarkeshwar Singh, Mukti Acharya:
Hypergraceful complete graphs. Australas. J Comb. 48: 5-24 (2010)
2000 – 2009
- 2006
- [j7]Sounaka Mishra, Siddani Bhaskara Rao:
Minimum monopoly in regular and tree graphs. Discret. Math. 306(14): 1586-1594 (2006) - 2005
- [j6]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
- [j5]K. Balasubramanian, V. Parameswaran, Siddani Bhaskara Rao:
Characterization of Cycle Stochastic Graphs. Electron. Notes Discret. Math. 15: 36 (2003) - [j4]Sounaka Mishra, Siddani Bhaskara Rao:
Minimum Monopoly in Regular and Tree Graphs. Electron. Notes Discret. Math. 15: 126 (2003) - [j3]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)
1970 – 1979
- 1979
- [j2]Siddani Bhaskara Rao:
The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs. Discret. Math. 28(3): 291-301 (1979) - [j1]Siddani Bhaskara Rao:
Solution of the Hamiltonian problem for self-complementary graphs. J. Comb. Theory B 27(1): 13-41 (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 21:22 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:
