default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeyed Mahmoud Sheikholeslami
Publications
- 2022
[j129]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)- [j122]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) - [j117]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) - [j116]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
- [j112]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) - [j106]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
- [j98]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) - 2019
- [j88]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) - [j84]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) - 2015
- [j54]Jafar Amjadi, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Game total domination subdivision number of a graph. Discret. Math. Algorithms Appl. 7(3): 1550023:1-1550023:11 (2015) - [j50]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Game domination subdivision number of a graph. J. Comb. Optim. 30(1): 109-119 (2015) - 2014
- [j47]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the total outer-connected domination in graphs. J. Comb. Optim. 27(3): 451-461 (2014) - 2013
- [j40]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) - [j39]Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the outer-connected domination in graphs. J. Comb. Optim. 26(1): 10-18 (2013) - 2012
- [j38]Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Signed edge majority total domination numbers in graphs. Ars Comb. 105: 375-385 (2012) - [j34]Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar, Douglas B. West:
Connected Domination Number of a Graph and its Complement. Graphs Comb. 28(1): 123-131 (2012) - 2011
- [j31]Hossein Karami, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami:
An upper bound for total domination subdivision numbers. Ars Comb. 102: 321-331 (2011) - [j28]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Bounding the total domination subdivision number of a graph in terms of its order. J. Comb. Optim. 21(2): 209-218 (2011) - 2010
- [j25]Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Inequalities of Nordhaus-Gaddum type for doubly connected domination number. Discret. Appl. Math. 158(14): 1465-1470 (2010) - [j24]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) - [j22]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) - [j21]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) - 2009
- [j20]Hossein Karami, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami:
Signed Edge Domination Numbers In Trees. Ars Comb. 93 (2009) - [j18]Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Lower bounds on the signed domination numbers of directed graphs. Discret. Math. 309(8): 2567-2570 (2009) - [j17]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
On the Roman domination number of a graph. Discret. Math. 309(10): 3447-3451 (2009) - [j16]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) - [j15]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Paired-Domination Subdivision Numbers of Graphs. Graphs Comb. 25(4): 503-512 (2009) - [j14]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) - 2008
- [j13]Hossein Karami, Seyed Mahmoud Sheikholeslami:
Trees whose domination subdivision number is one. Australas. J Comb. 40: 161-166 (2008) - [j12]Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Signed edge majority domination numbers in graphs. Australas. J Comb. 41: 291-296 (2008) - [j10]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total domination and total domination subdivision number of a graph and its complement. Discret. Math. 308(17): 4018-4023 (2008) - [j9]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Paired-domination number of a graph and its complement. Discret. Math. 308(24): 6601-6605 (2008) - [j8]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total Domination in K5- and K6-covered graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j7]Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Some Notes on Signed Edge Domination in Graphs. Graphs Comb. 24(1): 29-35 (2008) - [j6]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Disproof of a Conjecture on the Subdivision Domination Number of a Graph. Graphs Comb. 24(4): 309-312 (2008) - 2007
- [j4]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total domination and total domination subdivision numbers. Australas. J Comb. 38: 229-236 (2007)
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-08-13 21: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:
