default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReza Nikandish 0001
Person information
- affiliation: Jundi-Shapur University of Technology, Department of Mathematics, Dezful, Iran
- affiliation (former): K.N. Toosi University of Technology, Department of Mathematics, Tehran, Iran
Other persons with the same name
- Gholamreza Nikandish
![[0000-0002-9970-3368]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9970-3368")
(aka: Reza Nikandish 0002) — University College Dublin, School of Electrical and Electronic Engineering, Ireland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Maryam Pazoki, Reza Nikandish:
Computing the (forcing) strong metric dimension in strongly annihilating-ideal graphs. Appl. Algebra Eng. Commun. Comput. 36(2): 273-283 (2025)- 2024
- [j11]Mitra Jalali, Reza Nikandish:
Strong metric dimension in annihilating-ideal graph of commutative rings. Appl. Algebra Eng. Commun. Comput. 35(5): 615-627 (2024) - [j10]Reza Nikandish, M. Mehrara, Mohammad Javad Nikmehr:
Coloring in essential annihilating-ideal graphs of commutative rings. Soft Comput. 28(2): 875-881 (2024) - 2023
- [j9]Shokoufeh Ebrahimi, Reza Nikandish, Abolfazl Tehranian, Hamid Rasouli:
Metric dimension of complement of annihilator graphs associated with commutative rings. Appl. Algebra Eng. Commun. Comput. 34(6): 995-1011 (2023) - 2020
- [j8]Reza Nikandish, O. Khani Nasab, E. Dodonge:
Minimum identifying codes in some graphs differing by matchings. Discret. Math. Algorithms Appl. 12(3): 2050046:1-2050046:8 (2020) - [j7]Shokoufeh Ebrahimi, Abolfazl Tehranian, Reza Nikandish:
On perfect annihilator graphs of commutative rings. Discret. Math. Algorithms Appl. 12(5): 2050060:1-2050060:7 (2020)
2010 – 2019
- 2017
- [j6]Saieed Akbari, Babak Miraftab, Reza Nikandish:
A Note on Co-Maximal Ideal Graph of Commutative Rings. Ars Comb. 134: 261-265 (2017) - [j5]Ghodratollah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish, Farzad Shaveisi:
On the Structure of the Power Graph and the Enhanced Power Graph of a Group. Electron. J. Comb. 24(3): 3 (2017) - [j4]N. Kh. Tohidi, Mohammad Javad Nikmehr, Reza Nikandish:
On the strongly annihilating-ideal graph of a commutative ring. Discret. Math. Algorithms Appl. 9(2): 1750028:1-1750028:13 (2017) - 2016
- [j3]Reza Nikandish, Hamid Reza Maimani, Hasan Izanloo:
The annihilating-ideal graph of ℤn is weakly perfect. Contributions Discret. Math. 11(1) (2016) - 2014
- [j2]Reza Nikandish, Hamid Reza Maimani:
Dominating Sets of the Annihilating-Ideal Graphs. Electron. Notes Discret. Math. 45: 17-22 (2014) - 2012
- [j1]Ghodratollah Aalipour, Saieed Akbari, Reza Nikandish, Mohammad Javad Nikmehr, Farzad Shaveisi:
On the coloring of the annihilating-ideal graph of a commutative ring. Discret. Math. 312(17): 2620-2626 (2012)
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-02-15 01:23 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:
