On the diameter of a domination dot-critical graph
暂无分享,去创建一个
A graph G is domination dot-critical, or just dot-critical, if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. In this paper, we study an open question concerning of the diameter of a domination dot-critical graph G.
[1] David P. Sumner,et al. Domination dot-critical graphs , 2006, Discret. Math..
[2] Yang Yuansheng,et al. Domination dot-critical graphs with no critical vertices , 2008 .
[3] Yuansheng Yang,et al. Domination dot-critical graphs with no critical vertices , 2008, Discret. Math..