2 papers
math.CO2014
The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs
Fu-Tao Hu, Moo Young Sohn
Let be a graph. A subset is a dominating set if every vertex not in is adjacent to a vertex in . The domination number of , denoted by , is…
math.CO2010
On the existence problem of the total domination vertex critical graphs
Moo Young Sohn, Dongseok Kim, Young Soo Kwon +1
The existence problem of the total domination vertex critical graphs has been studied in a series of articles. The aim of the present article is twofold. First, we settle the exist…