@article {
author = {Mojdeh, Doost Ali and Sayed-Khalkhali, A. and Abdollahzadeh Ahangar, Hossein and Zhao, Yancai},
title = {Total $k$-distance domination critical graphs},
journal = {Transactions on Combinatorics},
volume = {5},
number = {3},
pages = {1-9},
year = {2016},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2016.11972},
abstract = {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.},
keywords = {Distance domination,total $k$-distance dominating set,total $k$-distance
domination-critical},
url = {https://toc.ui.ac.ir/article_11972.html},
eprint = {https://toc.ui.ac.ir/article_11972_e981fb3fc30d07aadf6dd763425eb32b.pdf}
}