%0 Journal Article
%T A linear-time algorithm to compute total [1, 2]-domination number of block graphs
%J AUT Journal of Mathematics and Computing
%I Amirkabir University of Technology
%Z
%A Sharifani, Pouyeh
%A Hooshmandasl, Mohammadreza
%A Alikhani, Saeid
%D 2020
%\ 10/01/2020
%V 1
%N 2
%P 263-270
%! A linear-time algorithm to compute total [1, 2]-domination number of block graphs
%K Total [1, 2]-set
%K Dominating set
%K Block graph
%R 10.22060/ajmc.2020.18444.1035
%X 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.
%U https://ajmc.aut.ac.ir/article_4029_c5e379fd5ea2da4be1fd158b707875ec.pdf