@article {
author = {P. Kazemi, Adel},
title = {$k$-tuple total restrained domination/domatic in graphs},
journal = {Bulletin of the Iranian Mathematical Society},
volume = {40},
number = {3},
pages = {751-763},
year = {2014},
publisher = {Iranian Mathematical Society (IMS)},
issn = {1017-060X},
eissn = {1735-8515},
doi = {},
abstract = {For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum number of classes of a partition of $V$ such that its all classes are $k$-tuple total restrained dominating sets in $G$ we call the $k$-tuple total restrained domatic number of $G$. In this paper, we give some sharp bounds for the $k$-tuple total restrained domination number of a graph, and also calculate it for some of the known graphs. Next, we mainly present basic properties of the $k$-tuple total restrained domatic number of a graph.},
keywords = {$k$-tuple total domination number,$k$-tuple total domatic number,$k$-tuple total restrained domination number,$k$-tuple total restrained domatic number},
url = {http://bims.iranjournals.ir/article_529.html},
eprint = {http://bims.iranjournals.ir/article_529_f5f373afe7aa443a872393ba1dd1ad50.pdf}
}