default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Reza Oboudi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Ashkan Nikseresht, Mohammad Reza Oboudi:
On Gorenstein circulant graphs. Discret. Math. 346(7): 113472 (2023)- [j15]Mohammad Reza Oboudi:
On graphs with integer Sombor index. J. Appl. Math. Comput. 69(1): 941-952 (2023) - 2021
- [j14]Mohammad Reza Oboudi
, Ali Zeydi Abdian, Ali Reza Ashrafi, Lowell W. Beineke:
Laplacian spectral determination of path-friendship graphs. AKCE Int. J. Graphs Comb. 18(1): 33-38 (2021) - [j13]Ali Zeydi Abdian, Lowell W. Beineke, Krishnaiyan Thulasiraman, Reza Tayebi Khorami, Mohammad Reza Oboudi:
The spectral determination of the connected multicone graphs. AKCE Int. J. Graphs Comb. 18(1): 47-52 (2021) - 2020
- [j12]Ali Zeydi Abdian, Lowell W. Beineke, Mohammad Reza Oboudi, Afshin Behmaram, Krishnaiyan Thulasiraman, Saeid Alikhani, Kewen Zhao:
On the spectral determinations of the connected multicone graphs. AKCE Int. J. Graphs Comb. 17(1): 149-158 (2020)
2010 – 2019
- 2018
- [j11]Mohammad Reza Oboudi:
On the largest real root of independence polynomials of trees. Ars Comb. 137: 149-164 (2018) - [j10]Mohammad Reza Oboudi:
Some results on the independence polynomial of unicyclic graphs. Discuss. Math. Graph Theory 38(2): 515-524 (2018) - [j9]Mohammad Reza Oboudi:
Majorization and the spectral radius of starlike trees. J. Comb. Optim. 36(1): 121-129 (2018) - [j8]Mohammad Reza Oboudi:
Correction to: Majorization and the spectral radius of starlike trees. J. Comb. Optim. 36(1): 130 (2018) - 2017
- [j7]Mohammad Reza Oboudi:
Characterization of graphs with exactly two non-negative eigenvalues. Ars Math. Contemp. 12(2): 271-286 (2017) - 2016
- [j6]Mohammad Reza Oboudi:
Bipartite graphs with at most six non-zero eigenvalues. Ars Math. Contemp. 11(2): 315-325 (2016) - [j5]Mohammad Reza Oboudi:
On the roots of domination polynomial of graphs. Discret. Appl. Math. 205: 126-131 (2016) - 2014
- [j4]Saieed Akbari, Mohammad Reza Oboudi:
Cycles are determined by their domination polynomials. Ars Comb. 116: 353-358 (2014) - 2013
- [j3]Saieed Akbari, Mohammad Reza Oboudi:
On the edge cover polynomial of a graph. Eur. J. Comb. 34(2): 297-321 (2013) - 2011
- [j2]Péter Csikvári, Mohammad Reza Oboudi:
On the roots of edge cover polynomials of graphs. Eur. J. Comb. 32(8): 1407-1416 (2011) - 2010
- [j1]Saieed Akbari, Ebrahim Ghorbani, Jacobus H. Koolen, Mohammad Reza Oboudi:
On Sum of Powers of the Laplacian and Signless Laplacian Eigenvalues of Graphs. Electron. J. Comb. 17(1) (2010)
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-04-24 23:21 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:
