k-Tuple total domination and Mycieleskian graphs
Let $k$ be a positive integer. A subset $S$ of $V(G)$ in a graph $G$ is a $k$-tuple total dominating set of $G$ if every vertex of $G$ has at least $k$ neighbors in $S$. The $k$-tuple total domination number $gamma _{times k,t}(G)$ of $G$ is the minimum cardinality of a $k$-tuple total dominating se...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2012-03-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=333&_ob=1c8f4a659abb4fec82b4bd7691dba941&fileName=full_text.pdf |