default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoo Young Sohn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Xue-gang Chen, Moo Young Sohn, De-xiang Ma:
Weighted k-domination problem in fuzzy networks. J. Intell. Fuzzy Syst. 44(5): 7643-7651 (2023)- 2022
- [j25]Young Soo Kwon, Jaeun Lee, Moo Young Sohn:
Classification of Efficient Dominating Sets of Circulant Graphs of Degree 5. Graphs Comb. 38(4): 120 (2022) - 2021
- [c1]Xuegang Chen, Moo Young Sohn:
Restrained and Total Restrained Domination in Cographs. AAIM 2021: 418-425 - 2020
- [j24]Young Soo Kwon, Moo Young Sohn, Xuegang Chen:
Existence of efficient total dominating sets of circulant graphs of degree 4. Discret. Math. 343(3): 111742 (2020) - [j23]Yanxia Dong, Moo Young Sohn, Zuosong Liang:
Domination and matching in power and generalized power hypergraphs. J. Comb. Optim. 39(2): 425-436 (2020) - [j22]Young Soo Kwon, Moo Young Sohn:
Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5. Symmetry 12(12): 1944 (2020)
2010 – 2019
- 2019
- [j21]Xue-Gang Chen, Moo Young Sohn
, De-Xiang Ma:
Total Efficient Domination in Fuzzy Graphs. IEEE Access 7: 155405-155411 (2019) - 2016
- [j20]Fu-Tao Hu, Moo Young Sohn, Xue-Gang Chen:
Total and paired domination numbers of Cm bundles over a cycle Cn. J. Comb. Optim. 32(2): 608-625 (2016) - 2015
- [j19]Huaming Xing, Moo Young Sohn:
Bounds on locating total domination number of the Cartesian product of cycles and paths. Inf. Process. Lett. 115(12): 950-956 (2015) - 2014
- [j18]Fu-Tao Hu, Moo Young Sohn:
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs. Theor. Comput. Sci. 535: 46-53 (2014) - 2013
- [j17]Moo Young Sohn, Fu-Tao Hu, Jaeun Lee:
Bondage Numbers of C4 Bundles over a Cycle Cn. J. Appl. Math. 2013: 520251:1-520251:5 (2013) - 2012
- [j16]Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn:
Constructing connected bicritical graphs with edge-connectivity 2. Discret. Appl. Math. 160(4-5): 488-493 (2012) - 2011
- [j15]Moo Young Sohn, Dongseok Kim, Young Soo Kwon, Jaeun Lee:
On the existence problem of the total domination vertex critical graphs. Discret. Appl. Math. 159(1): 46-52 (2011) - [j14]Xue-Gang Chen, Moo Young Sohn:
Bounds on the locating-total domination number of a tree. Discret. Appl. Math. 159(8): 769-773 (2011) - [j13]Xue-Gang Chen, Moo Young Sohn:
Domination Number of Graphs Without Small Cycles. Graphs Comb. 27(6): 821-830 (2011) - [j12]Yancai Zhao, Liying Kang, Moo Young Sohn:
The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412(22): 2387-2392 (2011)
2000 – 2009
- 2008
- [j11]Moo Young Sohn, Xudong Yuan:
i?(1)-perfect graphs with girth at least six. Ars Comb. 87 (2008) - [j10]Xue-Gang Chen, Moo Young Sohn:
A note on the total domination vertex critical graphs. Ars Comb. 88 (2008) - 2005
- [j9]Liying Kang, Moo Young Sohn, Hye Kyung Kim:
Bondage number of the discrete torus Cn×C4. Discret. Math. 303(1-3): 80-86 (2005) - [j8]Jin Ho Kwak, Jaeun Lee, Moo Young Sohn:
Bartholdi zeta functions of graph bundles having regular fibers. Eur. J. Comb. 26(5): 593-605 (2005) - 2004
- [j7]Liying Kang, Hye Kyung Kim, Moo Young Sohn:
Minus domination number in k-partite graphs. Discret. Math. 277(1-3): 295-300 (2004) - [j6]Liying Kang, Moo Young Sohn, T. C. Edwin Cheng:
Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004) - 2003
- [j5]Erfang Shan, Moo Young Sohn, Liying Kang:
Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003) - 2000
- [j4]Jin Ho Kwak, Sungpyo Hong, Jaeun Lee, Moo Young Sohn:
Isoperimetric numbers and bisection widths of double coverings of a complete graph. Ars Comb. 57 (2000) - [j3]Dan Archdeacon, Jin Ho Kwak, Jaeun Lee, Moo Young Sohn:
Bipartite covering graphs. Discret. Math. 214(1-3): 51-63 (2000)
1990 – 1999
- 1999
- [j2]Jaeun Lee, Moo Young Sohn, Hye Kyung Kim:
A Note on Graphs with Large Girth, Small Minus Domination Number. Discret. Appl. Math. 91(1-3): 299-303 (1999) - 1996
- [j1]Jin Ho Kwak, Jaeun Lee, Moo Young Sohn:
Isoperimetric numbers of graph bundles. Graphs Comb. 12(1): 239-251 (1996)
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 23:11 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:
