Total $k$-distance domination critical graphs
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 withindistance $k$ of a vertex in $S$. A graph $G$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (G - x) < gamma_{t}^{k}(G)$ for any vertex $xin V(G)$. In this paper,we i...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2016-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/article_11972_e981fb3fc30d07aadf6dd763425eb32b.pdf |
| Summary: | 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 withindistance $k$ of a vertex in $S$. A graph $G$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (G - x) < gamma_{t}^{k}(G)$ for any vertex $xin V(G)$. In this paper,we investigate some results on total $k$-distance domination-critical of graphs. |
|---|---|
| ISSN: | 2251-8657 2251-8665 |