default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Khoeilar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]R. Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3. Australas. J Comb. 83: 101-108 (2022)- [j27]Saeed Kosari, Zehui Shao, Xiaolong Shi, Seyed Mahmoud Sheikholeslami
, Mustapha Chellali, R. Khoeilar, Hossein Karami:
Cubic graphs have paired-domination number at most four-seventh of their orders. Discret. Math. 345(12): 113086 (2022) - [j26]S. Alyar, R. Khoeilar:
Sharp lower bounds on the sum-connectivity index of trees. Discret. Math. Algorithms Appl. 14(5): 2150153:1-2150153:18 (2022) - [j25]Mahla Kheibari, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
Lower and upper bounds on independent double Roman domination in trees. Electron. J. Graph Theory Appl. 10(2): 447-460 (2022) - [j24]Saeed Kosari, Zehui Shao, Seyed Mahmoud Sheikholeslami, Mustapha Chellali, Rana Khoeilar, Hossein Karami:
Double Roman Domination in Graphs with Minimum Degree at Least Two and No C5-cycle. Graphs Comb. 38(2): 39 (2022) - [j23]Zehui Shao, Seyed Mahmoud Sheikholeslami, Mustapha Chellali, Rana Khoeilar, Hossein Karami:
A proof of a conjecture on the paired-domination subdivision number. Graphs Comb. 38(3): 71 (2022) - 2021
- [j22]Saeed Kosari, Zehui Shao, R. Khoeilar, Hossein Karami, Seyed Mahmoud Sheikholeslami, Guoliang Hao:
On a conjecture concerning total domination subdivision number in graphs. AKCE Int. J. Graphs Comb. 18(3): 154-157 (2021) - [j21]L. Shahbazi, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
Total k-rainbow reinforcement number in graphs. Discret. Math. Algorithms Appl. 13(1): 2050101:1-2050101:16 (2021) - [j20]Rana Khoeilar, Jafar Amjadi:
Classification of rings with toroidal co-annihilating-ideal graphs. Discret. Math. Algorithms Appl. 13(2): 2150006:1-2150006:16 (2021) - [j19]R. Khoeilar, H. Shooshtari:
Two-tree graphs with maximum general sum-connectivity index. Discret. Math. Algorithms Appl. 13(3): 2150025:1-2150025:8 (2021) - [j18]Rana Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Nordhaus-Gaddum type results for connected and total domination. RAIRO Oper. Res. 55(Supplement): S853-S862 (2021) - 2020
- [j17]Rana Khoeilar, Mahla Kheibari, Zehui Shao, Seyed Mahmoud Sheikholeslami:
Total k-rainbow domination subdivision number in graphs. Comput. Sci. J. Moldova 28(2): 152-169 (2020) - [j16]Rana Khoeilar, Mahla Keibari, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two. Comput. Sci. J. Moldova 28(3): 373-388 (2020) - [j15]R. Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
A proof of a conjecture on the differential of a subcubic graph. Discret. Appl. Math. 287: 27-39 (2020) - [j14]L. Shahbazi, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
Signed total double Roman k-domination in graphs. Discret. Math. Algorithms Appl. 12(1): 2050009:1-2050009:18 (2020) - [j13]R. Khoeilar, L. Shahbazi, Seyed Mahmoud Sheikholeslami, Zehui Shao:
Bounds on the signed total Roman 2-domination in graphs. Discret. Math. Algorithms Appl. 12(1): 2050013:1-2050013:12 (2020) - [j12]Jafar Amjadi, R. Khoeilar, Mustapha Chellali, Zehui Shao:
On the Roman domination subdivision number of a graph. J. Comb. Optim. 40(2): 501-511 (2020)
2010 – 2019
- 2019
- [j11]Rana Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two. Discret. Appl. Math. 270: 159-167 (2019) - [j10]Rana Khoeilar, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On two conjectures concerning total domination subdivision number in graphs. J. Comb. Optim. 38(2): 333-340 (2019) - 2018
- [j9]Jafar Amjadi, R. Khoeilar, Marzieh Soroudi:
A correction on the signed bad number. Discret. Math. Algorithms Appl. 10(1): 1850009:1-1850009:3 (2018) - 2013
- [j8]Odile Favaron, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
Total outer-Connected domination subdivision numbers in graphs. Discret. Math. Algorithms Appl. 5(3) (2013) - [j7]Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle. J. Comb. Optim. 25(1): 91-98 (2013) - 2010
- [j6]Odile Favaron, Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
Matchings and total domination subdivision number in graphs with few induced 4-cycles. Discuss. Math. Graph Theory 30(4): 611-618 (2010) - [j5]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
On the total domination subdivision number in some classes of graphs. J. Comb. Optim. 20(1): 76-84 (2010) - [j4]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Proof of a conjecture on game domination. J. Graph Theory 64(4): 323-329 (2010)
2000 – 2009
- 2009
- [j3]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
On the Roman domination number of a graph. Discret. Math. 309(10): 3447-3451 (2009) - [j2]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
A New Bound on the Total Domination Subdivision Number. Graphs Comb. 25(1): 41-47 (2009) - [j1]Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
An Upper Bound for the Total Domination Subdivision Number of a Graph. Graphs Comb. 25(5): 727-733 (2009)
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 22:58 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:
