Domination Cover Number of Graphs

M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1

A set $D\subseteq V$ for the graph $G=(V,E)$ is called a dominating set if any vertex $v\in V\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for…