@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 = {},
eissn = {},
doi = {10.22060/ajmc.2020.18444.1035},
abstract = {Let G = (V, E) be a simple graph without isolated vertices. A set D ⊂ V is a total [1, 2]-dominating set if for every vertex v ∈ V , 1 ≤ |N(v) ∩ D| ≤ 2. The total [1, 2]-domination problem is to determine the total [1, 2]-domination number γ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 γ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_c5e379fd5ea2da4be1fd158b707875ec.pdf}
}