default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarishchandra S. Ramane
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j14]Maryam Baghipur, Harishchandra S. Ramane
:
On generalized adjacency Estrada index of graphs. Discret. Math. Algorithms Appl. 14(7): 2250036:1-2250036:23 (2022)- [j13]Sumedha S. Shinde, Harishchandra S. Ramane, Shaila B. Gudimani, Narayan Swamy:
Degree sum adjacency polynomial of standard graphs and graph operations. Electron. J. Graph Theory Appl. 10(1): 15 (2022) - 2021
- [j12]Sumedha S. Shinde, Narayan Swamy, Shaila B. Gudimani, Harishchandra S. Ramane:
Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices. Comput. Sci. J. Moldova 29(2): 271-283 (2021) - 2020
- [j11]Harishchandra S. Ramane, Ashwini S. Yalnaik, Reza Sharafdini:
Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs. AKCE Int. J. Graphs Comb. 17(1): 98-108 (2020) - [j10]Harishchandra S. Ramane, Kartik S. Pise, Daneshwari Patil:
Note on inverse sum indeg index of graphs. AKCE Int. J. Graphs Comb. 17(3): 985-987 (2020) - [j9]Harishchandra S. Ramane, Gouramma A. Gudodagi:
Computation of general Randić polynomial and general Randić energy of some graphs. Comput. Sci. J. Moldova 28(1): 59-79 (2020) - 2018
- [j8]Harishchandra S. Ramane, K. C. Nandeesh, Gouramma A. Gudodagi, B. Zhou:
Degree subtraction eigenvalues and energy of graphs. Comput. Sci. J. Moldova 26(2): 146-162 (2018) - 2017
- [j7]Harishchandra S. Ramane, Vinayak V. Manjalapur, Ivan Gutman:
General sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graph of subdivision graphs. AKCE Int. J. Graphs Comb. 14(1): 92-100 (2017) - [j6]Harishchandra S. Ramane, Sumedha S. Shinde:
Degree exponent polynomial of graphs obtained by some graph operations. Electron. Notes Discret. Math. 63: 161-168 (2017) - 2015
- [j5]Harishchandra S. Ramane, Ashwini S. Yalnaik:
Reciprocal complementary distance spectra and reciprocal complementary distance energy of line graphs of regular graphs. Electron. J. Graph Theory Appl. 3(2): 228-236 (2015) - 2005
- [j4]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
- [j3]Hanumappa B. Walikar, P. R. Hamipholi, Harishchandra S. Ramane:
Some Minimal Graphs by Interlacing Eigenvalues. Electron. Notes Discret. Math. 15: 216-218 (2003) - [j2]Hanumappa B. Walikar, Harishchandra S. Ramane:
On the Eigenvalues of a Graph. Electron. Notes Discret. Math. 15: 222-224 (2003) - [j1]Hanumappa B. Walikar, D. N. Misale, R. L. Patil, Harishchandra S. Ramane:
On the Resistance Distance of a Tree. Electron. Notes Discret. Math. 15: 244-245 (2003)
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 2025-03-04 22:25 CET 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:
