The discipline number of a graph (Q1174136)

The domination number \(\gamma(G)\) of a graph \(G\) is the size of a smallest set \(D\) of vertices such that every vertex outside \(D\) has at least one neighbour in \(D\). The bondage number \(b(G)\) is the least number of edges whose deletion increases \(\gamma(G)\). The solution of the dual problem to the linear programming relaxation of computing the bondage number is called the discipline number of \(G\). Here the authors state some results on the discipline number of complete multipartite graphs.