Total $k$-distance domination critical graphs
نویسندگان
1 University of Tafresh
2 Wuxi City College of Vocational Technology
3 University of Tafresh
4 Department of Basic Science, Babol University of Technology, Babol, I.R. Iran
doi
10.22108/toc.2016.11972چکیده
A set $S$ of vertices in a graph $G=(V,E)$ is called a total $k$-distance dominating set if every vertex in $V$ is within distance $k$ of a vertex in $S$. A graph $G$ is total $k$-distance domination-critical if $\gamma_{t}^{k} (G - x) < \gamma_{t}^{k} (G)$ for any vertex $x\in V(G)$. In this paper, we investigate some results on total $k$-distance domination-critical of graphs.
