Moo Young Sohn

According to our database, Moo Young Sohn authored at least 27 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Weighted <i>k</i>-domination problem in fuzzy networks.

Xue-gang Chen, Moo Young Sohn, De-xiang Ma

J. Intell. Fuzzy Syst., 2023

2022

Classification of Efficient Dominating Sets of Circulant Graphs of Degree 5.

Young Soo Kwon, Jaeun Lee, Moo Young Sohn

Graphs Comb., 2022

2021

Restrained and Total Restrained Domination in Cographs.

Xuegang Chen, Moo Young Sohn

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5.

Young Soo Kwon, Moo Young Sohn

Symmetry, 2020

Domination and matching in power and generalized power hypergraphs.

Yanxia Dong, Moo Young Sohn, Zuosong Liang

J. Comb. Optim., 2020

Existence of efficient total dominating sets of circulant graphs of degree 4.

Young Soo Kwon, Moo Young Sohn, Xuegang Chen

Discret. Math., 2020

2019

Total Efficient Domination in Fuzzy Graphs.

Xue-Gang Chen, Moo Young Sohn, De-Xiang Ma

IEEE Access, 2019

2016

Total and paired domination numbers of C_m bundles over a cycle C_n.

Fu-Tao Hu, Moo Young Sohn, Xue-Gang Chen

J. Comb. Optim., 2016

2015

Bounds on locating total domination number of the Cartesian product of cycles and paths.

Huaming Xing, Moo Young Sohn

Inf. Process. Lett., 2015

2014

The algorithmic complexity of bondage and reinforcement problems in bipartite graphs.

Fu-Tao Hu, Moo Young Sohn

Theor. Comput. Sci., 2014

2013

Bondage Numbers of C₄ Bundles over a Cycle C_n.

Moo Young Sohn, Fu-Tao Hu, Jaeun Lee

J. Appl. Math., 2013

2012

Constructing connected bicritical graphs with edge-connectivity 2.

Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn

Discret. Appl. Math., 2012

2011

The algorithmic complexity of mixed domination in graphs.

Yancai Zhao, Liying Kang, Moo Young Sohn

Theor. Comput. Sci., 2011

Domination Number of Graphs Without Small Cycles.

Xue-Gang Chen, Moo Young Sohn

Graphs Comb., 2011

On the existence problem of the total domination vertex critical graphs.

Moo Young Sohn, Dongseok Kim, Young Soo Kwon, Jaeun Lee

Discret. Appl. Math., 2011

Bounds on the locating-total domination number of a tree.

Xue-Gang Chen, Moo Young Sohn

Discret. Appl. Math., 2011

2008

i?(1)-perfect graphs with girth at least six.

Moo Young Sohn, Xudong Yuan

Ars Comb., 2008

A note on the total domination vertex critical graphs.

Xue-Gang Chen, Moo Young Sohn

Ars Comb., 2008

2005

Bartholdi zeta functions of graph bundles having regular fibers.

Jin Ho Kwak, Jaeun Lee, Moo Young Sohn

Eur. J. Comb., 2005

Bondage number of the discrete torus <i>C</i>_<i>n</i>×<i>C</i>₄.

Liying Kang, Moo Young Sohn, Hye Kyung Kim

Discret. Math., 2005

2004

Paired-domination in inflated graphs.

Liying Kang, Moo Young Sohn, T. C. Edwin Cheng

Theor. Comput. Sci., 2004

Minus domination number in k-partite graphs.

Liying Kang, Hye Kyung Kim, Moo Young Sohn

Discret. Math., 2004

2003

Upper bounds on signed 2-independence number of graphs.

Erfang Shan, Moo Young Sohn, Liying Kang

Ars Comb., 2003

2000

Bipartite covering graphs.

Dan Archdeacon, Jin Ho Kwak, Jaeun Lee, Moo Young Sohn

Discret. Math., 2000

Isoperimetric numbers and bisection widths of double coverings of a complete graph.

Jin Ho Kwak, Sungpyo Hong, Jaeun Lee, Moo Young Sohn

Ars Comb., 2000

1999

A Note on Graphs with Large Girth, Small Minus Domination Number.

Jaeun Lee, Moo Young Sohn, Hye Kyung Kim

Discret. Appl. Math., 1999

1996

Isoperimetric numbers of graph bundles.

Jin Ho Kwak, Jaeun Lee, Moo Young Sohn

Graphs Comb., 1996