Moo Young Sohn

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 9

Top Topics

Bipartite Graph

Machine Learning Methods

Classification Process

Top Venues

J. Comb. Optim.

Inf. Process. Lett.

Publications

Xue-gang Chen, Moo Young Sohn, De-xiang Ma
-domination problem in fuzzy networks. J. Intell. Fuzzy Syst. 44 (5) (2023)
Young Soo Kwon, Jaeun Lee, Moo Young Sohn
Classification of Efficient Dominating Sets of Circulant Graphs of Degree 5. Graphs Comb. 38 (4) (2022)
Xuegang Chen, Moo Young Sohn
Restrained and Total Restrained Domination in Cographs. AAIM (2021)
Young Soo Kwon, Moo Young Sohn, Xuegang Chen
Existence of efficient total dominating sets of circulant graphs of degree 4. Discret. Math. 343 (3) (2020)
Yanxia Dong, Moo Young Sohn, Zuosong Liang
Domination and matching in power and generalized power hypergraphs. J. Comb. Optim. 39 (2) (2020)
Young Soo Kwon, Moo Young Sohn
Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5. Symmetry 12 (12) (2020)
Xue-Gang Chen, Moo Young Sohn, De-Xiang Ma
Total Efficient Domination in Fuzzy Graphs. IEEE Access 7 (2019)
Fu-Tao Hu, Moo Young Sohn, Xue-Gang Chen
. J. Comb. Optim. 32 (2) (2016)
Huaming Xing, Moo Young Sohn
Bounds on locating total domination number of the Cartesian product of cycles and paths. Inf. Process. Lett. 115 (12) (2015)
Fu-Tao Hu, Moo Young Sohn
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs. Theor. Comput. Sci. 535 (2014)
Moo Young Sohn, Fu-Tao Hu, Jaeun Lee
. J. Appl. Math. 2013 (2013)
Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn
Constructing connected bicritical graphs with edge-connectivity 2. Discret. Appl. Math. 160 (4-5) (2012)
Xue-Gang Chen, Moo Young Sohn
Domination Number of Graphs Without Small Cycles. Graphs Comb. 27 (6) (2011)
Yancai Zhao, Liying Kang, Moo Young Sohn
The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412 (22) (2011)
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) (2011)
Xue-Gang Chen, Moo Young Sohn
Bounds on the locating-total domination number of a tree. Discret. Appl. Math. 159 (8) (2011)
Moo Young Sohn, Xudong Yuan
i?(1)-perfect graphs with girth at least six. Ars Comb. 87 (2008)
Xue-Gang Chen, Moo Young Sohn
A note on the total domination vertex critical graphs. Ars Comb. 88 (2008)
Liying Kang, Moo Young Sohn, Hye Kyung Kim
. Discret. Math. 303 (1-3) (2005)
Jin Ho Kwak, Jaeun Lee, Moo Young Sohn
Bartholdi zeta functions of graph bundles having regular fibers. Eur. J. Comb. 26 (5) (2005)
Liying Kang, Moo Young Sohn, T. C. Edwin Cheng
Paired-domination in inflated graphs. Theor. Comput. Sci. 320 (2-3) (2004)
Liying Kang, Hye Kyung Kim, Moo Young Sohn
Minus domination number in k-partite graphs. Discret. Math. 277 (1-3) (2004)
Erfang Shan, Moo Young Sohn, Liying Kang
Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003)
Dan Archdeacon, Jin Ho Kwak, Jaeun Lee, Moo Young Sohn
Bipartite covering graphs. Discret. Math. 214 (1-3) (2000)
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)
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) (1999)
Jin Ho Kwak, Jaeun Lee, Moo Young Sohn
Isoperimetric numbers of graph bundles. Graphs Comb. 12 (1) (1996)