default search action
Vladimir Samodivkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j21]Vladimir Samodivkin
:
Domination related parameters in the generalized lexicographic product of graphs. Discret. Appl. Math. 300: 77-84 (2021) - [j20]Vladimir Samodivkin
Changing and unchanging of the domination number of a graph: path addition numbers. Discuss. Math. Graph Theory 41(2): 365-379 (2021) - [j19]Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Mustapha Chellali, Saeed Kosari, Vladimir Samodivkin
Some progress on the mixed roman domination in graphs. RAIRO Oper. Res. 55(Supplement): S1411-S1423 (2021)
2010 – 2019
- 2019
- [j18]Wenjie Fan, Ansheng Ye, Fang Miao, Zehui Shao
Outer-Independent Italian Domination in Graphs. IEEE Access 7: 22756-22762 (2019) - [j17]Xiaolong Shi, Pu Wu, Zehui Shao
Changing and Unchanging 2-Rainbow Independent Domination. IEEE Access 7: 72604-72612 (2019) - 2018
- [j16]Vladimir Dimitrov Samodivkin
Upper bounds on the bondage number of a graph. Electron. J. Graph Theory Appl. 6(1): 1-16 (2018) - 2017
- [j15]Hossein Abdollahzadeh Ahangar, M. Najimi, Vladimir Samodivkin
The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity. AKCE Int. J. Graphs Comb. 14(3): 242-250 (2017) - [j14]Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Vladimir Samodivkin
Outer independent Roman dominating functions in graphs. Int. J. Comput. Math. 94(12): 2547-2557 (2017) - 2016
- [j13]Vladimir Samodivkin:
Upper bounds for domination related parameters in graphs on surfaces. AKCE Int. J. Graphs Comb. 13(2): 140-145 (2016) - [j12]Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Vladimir Samodivkin, Lutz Volkmann:
On the rainbow restrained domination number. Ars Comb. 125: 209-224 (2016) - [j11]Hossein Abdollahzadeh Ahangar, Futaba Fujie-Okamoto, Vladimir Samodivkin:
On the forcing connected geodetic number and the connected geodetic number of a graph. Ars Comb. 126: 323-335 (2016) - [j10]Vladimir Samodivkin
Roman domination in graphs: The class ℛUV R. Discret. Math. Algorithms Appl. 8(3): 1650049:1-1650049:14 (2016) - [j9]Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Dorota Kuziak
On maximal Roman domination in graphs. Int. J. Comput. Math. 93(7): 1093-1102 (2016) - 2015
- [j8]Vladimir Samodivkin:
Roman domination with respect to nondegenerate graph properties: vertex and edge removal. Australas. J Comb. 63: 41-57 (2015) - 2014
- [j7]Hossein Abdollahzadeh Ahangar, Michael A. Henning, Christian Löwenstein, Yancai Zhao, Vladimir Samodivkin
Signed Roman domination in graphs. J. Comb. Optim. 27(2): 241-255 (2014) - 2013
- [j6]Vladimir Samodivkin:
Note on the bondage number of graphs on topological surfaces. Australas. J Comb. 56: 183-186 (2013) - 2010
- [j5]Vladimir Samodivkin:
Domination by Union of Complete Graphs. Ars Comb. 95 (2010)
2000 – 2009
- 2009
- [j4]Vladimir Samodivkin:
Domination with respect to nondegenerate properties: bondage number. Australas. J Comb. 45: 217-226 (2009) - 2008
- [j3]Vladimir Samodivkin
Changing and unchanging of the domination number of a graph. Discret. Math. 308(22): 5015-5025 (2008) - [j2]Vladimir Samodivkin
The bondage number of graphs: good and bad vertices. Discuss. Math. Graph Theory 28(3): 453-462 (2008) - 2007
- [j1]Vladimir Samodivkin:
Changing and unchanging acyclic domination: edge addition. Australas. J Comb. 38: 309- (2007)
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-10-07 21:16 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: