@article {
author = {Sharifani, Pouyeh and Hooshmandasl, Mohammadreza and Alikhani, Saeid},
title = {A linear-time algorithm to compute total $[1,2]$-domination number of block graphs},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {263-270},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {2783-2449},
eissn = {2783-2287},
doi = {10.22060/ajmc.2020.18444.1035},
abstract = {Let $G=(V, E)$ be a simple graph without isolated vertices. A set $D\subseteq V$ is a total $[1,2]$-dominating set if for every vertex $v\in V , 1\leq |N(v)\cap D|\leq 2$. The total $[1,2]$-domination problem is to determine the total $[1,2]$-domination number $\gamma_{t[1,2]}(G)$, which is the minimum cardinality of a total $[1,2]$-dominating set for a graph $G$. In this paper, we present a linear-time algorithm to compute $\gamma_{t[1,2]}(G)$, for a block graph $G$.},
keywords = {Total $[1,2]$-set,Dominating set,Block graph},
url = {https://ajmc.aut.ac.ir/article_4029.html},
eprint = {https://ajmc.aut.ac.ir/article_4029_db3fbe3f0db6f6079698d2381e798970.pdf}
}