A survey on graphs which have equal domination and closed neighbourhood packing numbers (Q2370386)

\textit{A. Meir} and \textit{J. W. Moon} [Pac. J. Math. 61, 225--233 (1975; Zbl 0289.05101)] showed that the domination number and the (closed neighbourhood) packing number of any tree \(T\) are equal. The authors, using linear programming, give several sufficient conditions for the domination and packing numbers of a graph \(G\) to be equal. They also show, among other things, that for a regular graph \(G\) these two numbers are equal if and only if \(G\) has a dominating set \(S\) such that each vertex of \(G\) is dominated by exactly one member of \(S\).