![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Nasrin Dehgardi
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Nasrin Dehgardi, Mahdieh Azari
:
Trees, unicyclic graphs and their geometric Sombor index: an extremal approach. Comput. Appl. Math. 43(5): 271 (2024) - [j10]Nasrin Dehgardi
, Tomislav Doslic:
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number. Discret. Appl. Math. 345: 52-61 (2024) - 2023
- [j9]Mahdieh Azari
, Nasrin Dehgardi, Tomislav Doslic:
Lower bounds on the irregularity of trees and unicyclic graphs. Discret. Appl. Math. 324: 136-144 (2023) - 2022
- [j8]Jonecis A. Dayap
, Nasrin Dehgardi, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami:
The minus total k-domination numbers in graphs. Discret. Math. Algorithms Appl. 14(5): 2150150:1-2150150:15 (2022) - 2021
- [j7]Hamideh Aram, Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Lutz Volkmann:
Domination, independent domination number and 2-independence number in trees. Discuss. Math. Graph Theory 41(1): 39-49 (2021)
2010 – 2019
- 2018
- [j6]Jafar Amjadi, Seyed Mahmoud Sheikholeslami
, Mina Valinavaz, Nasrin Dehgardi:
Independent Roman domination and 2-independence in trees. Discret. Math. Algorithms Appl. 10(4): 1850052:1-1850052:10 (2018) - 2017
- [j5]Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami
, Lutz Volkmann:
The k-rainbow reinforcement numbers in graphs. Discret. Appl. Math. 217: 394-404 (2017) - [j4]Maryam Atapour, Nasrin Dehgardi:
Twin minus total domination numbers in directed graphs. Discuss. Math. Graph Theory 37(4): 989-1004 (2017) - [j3]Jafar Amjadi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami:
A sufficient condition for large rainbow domination number. Int. J. Comput. Math. Comput. Syst. Theory 2(2): 53-65 (2017) - [j2]Masoud Atapour, Nasrin Dehgardi, Lutz Volkmann:
An introduction to the twin signed total k-domination numbers in directed graphs. RAIRO Oper. Res. 51(4): 1331-1343 (2017) - 2014
- [j1]Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami
, Lutz Volkmann
:
The k-rainbow bondage number of a graph. Discret. Appl. Math. 174: 133-139 (2014)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-20 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint